Sciweavers

STOC
2003
ACM
152views Algorithms» more  STOC 2003»
14 years 4 months ago
Cell-probe lower bounds for the partial match problem
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Raba...
STOC
2003
ACM
80views Algorithms» more  STOC 2003»
14 years 4 months ago
Polylogarithmic inapproximability
Eran Halperin, Robert Krauthgamer
STOC
2003
ACM
135views Algorithms» more  STOC 2003»
14 years 4 months ago
Linear time encodable and list decodable codes
Venkatesan Guruswami, Piotr Indyk
STOC
2003
ACM
100views Algorithms» more  STOC 2003»
14 years 4 months ago
Simpler and better approximation algorithms for network design
Anupam Gupta, Amit Kumar, Tim Roughgarden
STOC
2003
ACM
99views Algorithms» more  STOC 2003»
14 years 4 months ago
On the fractal behavior of TCP
We propose a natural, mathematically tractable model of TCP which captures both its additive-increase, multiplicative-decrease behavior and its feedback mechanism. Neither a fluid...
Anna C. Gilbert, Howard J. Karloff
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
14 years 4 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
STOC
2003
ACM
118views Algorithms» more  STOC 2003»
14 years 4 months ago
A proof of Alon's second eigenvalue conjecture
A d-regular graph has largest or first (adjacency matrix) eigenvalue 1 = d. In this paper we show the following conjecture of Alon. Fix an integer d > 2 and a real > 0. Then...
Joel Friedman
STOC
2003
ACM
64views Algorithms» more  STOC 2003»
14 years 4 months ago
Hidden translation and orbit coset in quantum computing
Katalin Friedl, Gábor Ivanyos, Fréd&...