Sciweavers

STOC
2006
ACM
108views Algorithms» more  STOC 2006»
14 years 8 months ago
Local zero knowledge
Silvio Micali, Rafael Pass
STOC
2006
ACM
186views Algorithms» more  STOC 2006»
14 years 8 months ago
A subset spanner for Planar graphs, : with application to subset TSP
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
Philip N. Klein
STOC
2006
ACM
77views Algorithms» more  STOC 2006»
14 years 8 months ago
Graph partitioning using single commodity flows
Rohit Khandekar, Satish Rao, Umesh V. Vazirani
STOC
2006
ACM
83views Algorithms» more  STOC 2006»
14 years 8 months ago
A randomized polynomial-time simplex algorithm for linear programming
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...
Jonathan A. Kelner, Daniel A. Spielman
STOC
2006
ACM
125views Algorithms» more  STOC 2006»
14 years 8 months ago
On earthmover distance, metric labeling, and 0-extension
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yu...
STOC
2006
ACM
78views Algorithms» more  STOC 2006»
14 years 8 months ago
Deterministic extractors for small-space sources
Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zucke...
STOC
2006
ACM
120views Algorithms» more  STOC 2006»
14 years 8 months ago
Black-box constructions for secure computation
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Ere...
STOC
2006
ACM
158views Algorithms» more  STOC 2006»
14 years 8 months ago
The effect of collusion in congestion games
Ara Hayrapetyan, Éva Tardos, Tom Wexler
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
14 years 8 months ago
Explicit capacity-achieving list-decodable codes
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
Venkatesan Guruswami, Atri Rudra
STOC
2006
ACM
59views Algorithms» more  STOC 2006»
14 years 8 months ago
Reducibility among equilibrium problems
In this paper, we improve a recent result of Daskalakis, Goldberg and Papadimitriou on PPAD-completeness of 4-Nash, showing that 3-Nash is PPAD-complete.
Paul W. Goldberg, Christos H. Papadimitriou