CORR
2010
Springer
13 years 7 months ago
2010
Springer
We exhibit incentive compatible multi-unit auctions that are not affine maximizers (i.e. are not of the VCG family) and yet approximate the social welfare to within a factor of 1 ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We propose a new measure that quantifies the "closeness" between two nodes in a given graph. The calculation of the measure is linear in the number of edges in the graph...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
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...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
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...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
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...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
CORR
2010
Springer
13 years 7 months ago
2010
Springer
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 ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
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 ...