Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
STOC
2004
ACM
138views Algorithms» more  STOC 2004»
11 years 6 months ago
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
Gurmeet Singh Manku, Moni Naor, Udi Wieder
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
12 years 1 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
STOC
2004
ACM
104views Algorithms» more  STOC 2004»
12 years 1 months ago
Network games
The growth in computer games and wireless networks has catalyzed the production of a new generation of hand-held game consoles that support multi-player gaming over IEEE 802.11 ne...
Éva Tardos
STOC
2004
ACM
126views Algorithms» more  STOC 2004»
12 years 1 months ago
Bypassing the embedding: algorithms for low dimensional metrics
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
Kunal Talwar
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
12 years 1 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
STOC
2004
ACM
89views Algorithms» more  STOC 2004»
12 years 1 months ago
A new family of Cayley expanders (?)
Eyal Rozenman, Aner Shalev, Avi Wigderson
STOC
2004
ACM
117views Algorithms» more  STOC 2004»
12 years 1 months ago
New notions of security: achieving universal composability without trusted setup
We propose a modification to the framework of Universally Composable (UC) security [3]. Our new notion, involves comparing the protocol executions with an ideal execution involvin...
Manoj Prabhakaran, Amit Sahai
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
12 years 1 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
12 years 1 months ago
Bounded-concurrent secure multi-party computation with a dishonest majority
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
Rafael Pass
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
12 years 1 months ago
Approximate max-integral-flow/min-multicut theorems
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
Kenji Obata
books