315 search results - page 54 / 63 » Cell-probe lower bounds for the partial match problem |
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
STOC
2002
ACM
14 years 7 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...
EUROCRYPT
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. We consider the question of adaptive security for two related cryptographic primitives: all-or-nothing transforms and exposureresilient functions. Both are concerned with...
CAAN
2006
Springer
13 years 11 months ago
2006
Springer
Gossiping is a communication primitive where each node of a network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping ...