STOC
2007
ACM
15 years 5 days ago
2007
ACM
STOC
2007
ACM
15 years 5 days ago
2007
ACM
STOC
2007
ACM
15 years 5 days 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
15 years 5 days 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
15 years 5 days 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
15 years 5 days 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
15 years 5 days 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...
STOC
2007
ACM
15 years 5 days ago
2007
ACM
STOC
2007
ACM
15 years 5 days ago
2007
ACM
STOC
2007
ACM
15 years 5 days ago
2007
ACM
A classic result due to H?astad established that for every constant > 0, given an overdetermined system of linear equations over a finite field Fq where each equation depends o...