50. FOCS 2009:
Atlanta, Georgia, USA
50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA.
IEEE Computer Society 2009, ISBN 978-0-7695-3850-1
export record as
dblp key:
Ankur Moitra :
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size.
3-12
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
conf/focs/ChattopadhyayW09
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
David Doty :
Randomized Self-Assembly for Exact Shapes.
85-94
export record as
dblp key:
Daniel Gottesman ,
Sandy Irani :
The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems.
95-104
export record as
dblp key:
conf/focs/ChakrabartyCK09
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
conf/focs/DiakonikolasGJSV09
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Ravindran Kannan :
A New Probability Inequality Using Typical Moments and Concentration Results.
211-220
export record as
dblp key:
Falk Unger :
A Probabilistic Inequality with Applications to Threshold Direct-Product Theorems.
221-229
export record as
dblp key:
export record as
dblp key:
Iftach Haitner :
A Parallel Repetition Theorem for Any Interactive Argument.
241-250
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
conf/focs/ChierichettiKLPR09
export record as
dblp key:
export record as
dblp key:
Jonah Sherman :
Breaking the Multicommodity Flow Barrier for O(vlog n)-Approximations to Sparsest Cut.
363-372
export record as
dblp key:
Vitaly Feldman :
A Complete Characterization of Statistical Query Learning with Applications to Evolvability.
375-384
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Zeev Nutov :
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions.
417-426
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Or Meir :
Combinatorial PCPs with Efficient Verifiers.
463-471
export record as
dblp key:
export record as
dblp key:
conf/focs/KalyanaramanU09
export record as
dblp key:
conf/focs/ChakrabortyHK09
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Ben Reichardt :
Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function.
544-551
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
conf/focs/RaghavendraS09a
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
conf/focs/BodlaenderFLPST09
export record as
dblp key:
conf/focs/Kawarabayashi09
export record as
dblp key:
Jan Vondrák :
Symmetry and Approximability of Submodular Maximization Problems.
651-670
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Aaron Bernstein :
Fully Dynamic (2 + epsilon) Approximate All-Pairs Shortest Paths with Fast Query and Close to Linear Update Time.
693-702
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key: