STOC
2007
ACM
14 years 4 months ago
2007
ACM
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
STOC
2007
ACM
14 years 4 months ago
2007
ACM
In the all-pairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real non-negative capacities on its edges and is aske...
STOC
2007
ACM
14 years 4 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
STOC
2007
ACM
14 years 4 months ago
2007
ACM
STOC
2007
ACM
14 years 4 months ago
2007
ACM
STOC
2007
ACM
14 years 4 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
STOC
2007
ACM
14 years 4 months ago
2007
ACM
: Consider a game where a referee chooses (x,y) according to a publicly known distribution, sends x to Alice, and y to Bob. Without communicating with each other, Alice responds wi...
STOC
2007
ACM
14 years 4 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
STOC
2007
ACM
14 years 4 months ago
2007
ACM
Compressed Sensing is a new paradigm for acquiring the compressible signals that arise in many applications. These signals can be approximated using an amount of information much ...
STOC
2007
ACM
14 years 4 months ago
2007
ACM
A distributed consensus algorithm allows n processes to reach a common decision value starting from individual inputs. Wait-free consensus, in which a process always terminates wi...