Sciweavers

STOC
2009
ACM
137views Algorithms» more  STOC 2009»
14 years 11 months ago
Mixing time for the solid-on-solid model
We analyze the mixing time of a natural local Markov chain (the Glauber dynamics) on configurations of the solid-onsolid model of statistical physics. This model has been proposed...
Fabio Martinelli, Alistair Sinclair
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
14 years 11 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
STOC
2009
ACM
113views Algorithms» more  STOC 2009»
14 years 11 months ago
The extended BG-simulation and the characterization of t-resiliency
A distributed task T on n processors is an input/output relation between a collection of processors' inputs and outputs. While all tasks are solvable if no processor may ever...
Eli Gafni
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
14 years 11 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
STOC
2009
ACM
136views Algorithms» more  STOC 2009»
14 years 11 months ago
Random walks on polytopes and an affine interior point method for linear programming
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
Ravi Kannan, Hariharan Narayanan
STOC
2009
ACM
146views Algorithms» more  STOC 2009»
14 years 11 months ago
Conditional hardness for satisfiable 3-CSPs
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
Ryan O'Donnell, Yi Wu
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
14 years 11 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
14 years 11 months ago
Short seed extractors against quantum storage
Some, but not all, extractors resist adversaries with limited quantum storage. In this paper we show that Trevisan's extractor has this property, thereby showing an extractor...
Amnon Ta-Shma
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
14 years 11 months ago
Numerical linear algebra in the streaming model
We give near-optimal space bounds in the streaming model for linear algebra problems that include estimation of matrix products, linear regression, low-rank approximation, and app...
Kenneth L. Clarkson, David P. Woodruff
STOC
2009
ACM
112views Algorithms» more  STOC 2009»
14 years 11 months ago
A new approach to auctions and resilient mechanism design
We put forward a new approach to mechanism design, and exemplify it via a new mechanism guaranteeing significant revenue in unrestricted combinatorial auctions. Our mechanism ? su...
Jing Chen, Silvio Micali