Sciweavers

STOC
2009
ACM
91views Algorithms» more  STOC 2009»
14 years 5 months ago
Inaccessible entropy
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
Iftach Haitner, Omer Reingold, Salil P. Vadhan, Ho...
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
14 years 5 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
STOC
2009
ACM
364views Algorithms» more  STOC 2009»
14 years 5 months ago
Distributed (delta+1)-coloring in linear (in delta) time
Leonid Barenboim, Michael Elkin
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
14 years 5 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
14 years 5 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger
STOC
2009
ACM
137views Algorithms» more  STOC 2009»
14 years 5 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 5 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 5 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 5 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 5 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