Sciweavers

STOC
2004
ACM
94views Algorithms» more  STOC 2004»
14 years 5 months ago
Completeness in two-party secure computation: a computational view
Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
14 years 5 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami
STOC
2004
ACM
118views Algorithms» more  STOC 2004»
14 years 5 months ago
Boosted sampling: approximation algorithms for stochastic optimization
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
14 years 5 months ago
Sharp thresholds For monotone properties in random geometric graphs
Ashish Goel, Sanatan Rai, Bhaskar Krishnamachari
STOC
2004
ACM
77views Algorithms» more  STOC 2004»
14 years 5 months ago
Auction algorithms for market equilibrium
Rahul Garg, Sanjiv Kapoor
STOC
2004
ACM
84views Algorithms» more  STOC 2004»
14 years 5 months ago
Computing Nash equilibria for scheduling on restricted parallel links
Martin Gairing, Thomas Lücking, Marios Mavron...
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
14 years 5 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
STOC
2004
ACM
110views Algorithms» more  STOC 2004»
14 years 5 months ago
On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
Uriel Feige
STOC
2004
ACM
96views Algorithms» more  STOC 2004»
14 years 5 months ago
The complexity of pure Nash equilibria
Alex Fabrikant, Christos H. Papadimitriou, Kunal T...