Sciweavers

CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 11 months ago
Liberalizing Dependency
Abstract. The dependency core calculus (DCC), a simple extension of the computational lambda calculus, captures a common notion of dependency that arises in many programming langua...
Avik Chaudhuri
CORR
2010
Springer
200views Education» more  CORR 2010»
13 years 11 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
CORR
2010
Springer
96views Education» more  CORR 2010»
13 years 11 months ago
Strong Fault-Tolerance for Self-Assembly with Fuzzy Temperature
We consider the problem of fault-tolerance in nanoscale algorithmic self-assembly. We employ t of Winfree's abstract Tile Assembly Model (aTAM), the two-handed aTAM, in which...
David Doty, Matthew J. Patitz, Dustin Reishus, Rob...
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 11 months ago
The Automatic Synthesis of Linear Ranking Functions: The Complete Unabridged Version
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
Roberto Bagnara, Fred Mesnard, Andrea Pescetti, En...
CORR
2010
Springer
82views Education» more  CORR 2010»
13 years 11 months ago
Spying the World from your Laptop -- Identifying and Profiling Content Providers and Big Downloaders in BitTorrent
This paper presents a set of exploits an adversary can use to continuously spy on most BitTorrent users of the Internet from a single machine and for a long period of time. Using ...
Stevens Le-Blond, Arnaud Legout, Fabrice Le Fessan...
CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 11 months ago
On building minimal automaton for subset matching queries
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
Kimmo Fredriksson
CORR
2010
Springer
91views Education» more  CORR 2010»
13 years 11 months ago
A Separation of NP and coNP in Multiparty Communication Complexity
: We prove that coNP MA in the number-on-forehead model of multiparty communication complexity for up to k = (1 - )logn players, where > 0 is any constant. Specifically, we con...
Dmitry Gavinsky, Alexander A. Sherstov
CORR
2010
Springer
67views Education» more  CORR 2010»
13 years 11 months ago
Rate Regions of Secret Key Sharing in a New Source Model
A source model for secret key generation between terminals is considered. Two users, namely users 1 and 2, at one side communicate with another user, namely user 3, at the other si...
Somayeh Salimi, Mahmoud Salmasizadeh, Mohammad Rez...
CORR
2010
Springer
108views Education» more  CORR 2010»
13 years 11 months ago
Generalized Secure Distributed Source Coding with Side Information
In this paper, new inner and outer bounds on the achievable compression-equivocation rate region for generalized secure data compression with side information are given that do not...
Somayeh Salimi, Mahmoud Salmasizadeh, Mohammad Rez...