1. Home
  2. Proceedings
  3. FOCS
  4. FOCS 2009
Default Cover Image

2009 50th Annual IEEE Symposium on Foundations of Computer Science

Oct. 25 2009 to Oct. 27 2009

Atlanta, GA

Table of Contents

[Title page i]Freely available from IEEE.
[Title page iii]Freely available from IEEE.
[Copyright notice]Freely available from IEEE.
Table of contentsFreely available from IEEE.
Message from Program ChairFreely available from IEEE.
Organizing CommitteeFreely available from IEEE.
list-reviewerFreely available from IEEE.
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph SizeFull-text access may be available. Sign in or learn about subscription options.
by Ankur Moitra
Faster Generation of Random Spanning TreesFull-text access may be available. Sign in or learn about subscription options.
by Jonathan A. Kelner, Aleksander Madry
Local Graph Partitions for Approximation and TestingFull-text access may be available. Sign in or learn about subscription options.
by Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguyen, Krzysztof Onak
Oblivious Routing for the Lp-normFull-text access may be available. Sign in or learn about subscription options.
by Matthias Englert, Harald Räcke
Linear Systems over Composite ModuliFull-text access may be available. Sign in or learn about subscription options.
by Arkadev Chattopadhyay, Avi Wigderson
Multiparty Communication Complexity and Threshold Circuit Size of AC^0Full-text access may be available. Sign in or learn about subscription options.
by Paul Beame, Dang-Trinh Huynh-Ngoc
The Communication Complexity of Set-Disjointness with Small Sets and 0-1 IntersectionFull-text access may be available. Sign in or learn about subscription options.
by Eyal Kushilevitz, Enav Weinreb
Polynomial Hierarchy, Betti Numbers and a Real Analogue of Toda's TheoremFull-text access may be available. Sign in or learn about subscription options.
by Saugata Basu, Thierry Zell
Randomized Self-Assembly for Exact ShapesFull-text access may be available. Sign in or learn about subscription options.
by David Doty
The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian ProblemsFull-text access may be available. Sign in or learn about subscription options.
by Daniel Gottesman, Sandy Irani
On Allocating Goods to Maximize FairnessFull-text access may be available. Sign in or learn about subscription options.
by Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna
Online Stochastic Matching: Beating 1-1/eFull-text access may be available. Sign in or learn about subscription options.
by Jon Feldman, Aranyak Mehta, Vahab Mirrokni, S. Muthukrishnan
Instance-Optimal Geometric AlgorithmsFull-text access may be available. Sign in or learn about subscription options.
by Peyman Afshani, Jérémy Barbay, Timothy M. Chan
Delaunay Triangulations in O(sort(n)) Time and MoreFull-text access may be available. Sign in or learn about subscription options.
by Kevin Buchin, Wolfgang Mulzer
Orthogonal Range Reporting in Three and Higher DimensionsFull-text access may be available. Sign in or learn about subscription options.
by Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
Decomposing Coverings and the Planar Sensor Cover ProblemFull-text access may be available. Sign in or learn about subscription options.
by Matt Gibson, Kasturi Varadarajan
Bounded Independence Fools HalfspacesFull-text access may be available. Sign in or learn about subscription options.
by Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and MergersFull-text access may be available. Sign in or learn about subscription options.
by Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan
Constructing Small-Bias Sets from Algebraic-Geometric CodesFull-text access may be available. Sign in or learn about subscription options.
by Avraham Ben-Aroya, Amnon Ta-Shma
Blackbox Polynomial Identity Testing for Depth 3 CircuitsFull-text access may be available. Sign in or learn about subscription options.
by Neeraj Kayal, Shubhangi Saraf
A New Probability Inequality Using Typical Moments and Concentration ResultsFull-text access may be available. Sign in or learn about subscription options.
by Ravindran Kannan
A Probabilistic Inequality with Applications to Threshold Direct-Product TheoremsFull-text access may be available. Sign in or learn about subscription options.
by Falk Unger
Choice-Memory Tradeoff in AllocationsFull-text access may be available. Sign in or learn about subscription options.
by Noga Alon, Eyal Lubetzky, Ori Gurel-Gurevich
A Parallel Repetition Theorem for Any Interactive ArgumentFull-text access may be available. Sign in or learn about subscription options.
by Iftach Haitner
Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation StrategyFull-text access may be available. Sign in or learn about subscription options.
by Yi Deng, Vipul Goyal, Amit Sahai
Extracting CorrelationsFull-text access may be available. Sign in or learn about subscription options.
by Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai
Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable UtilitiesFull-text access may be available. Sign in or learn about subscription options.
by Xi Chen, Decheng Dai, Ye Du, Shang-Hua Teng
Reducibility among Fractional Stability ProblemsFull-text access may be available. Sign in or learn about subscription options.
by Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng
Convergence of Local Dynamics to Balanced Outcomes in Exchange NetworksFull-text access may be available. Sign in or learn about subscription options.
by Yossi Azar, Benjamin Birnbaum, L. Elisa Celis, Nikhil R. Devanur, Yuval Peres
Convergence to Equilibrium in Local Interaction GamesFull-text access may be available. Sign in or learn about subscription options.
by Andrea Montanari, Amin Saberi
Exact and Approximate Pattern Matching in the Streaming ModelFull-text access may be available. Sign in or learn about subscription options.
by Benny Porat, Ely Porat
Efficient Sketches for Earth-Mover Distance, with ApplicationsFull-text access may be available. Sign in or learn about subscription options.
by Alexandr Andoni, Khanh Do Ba, Piotr Indyk, David Woodruff
Models for the Compressible WebFull-text access may be available. Sign in or learn about subscription options.
by Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, Prabhakar Raghavan
The Intersection of Two Halfspaces Has High Threshold DegreeFull-text access may be available. Sign in or learn about subscription options.
by Alexander A. Sherstov
Breaking the multicommodity flow barrier for o(√log n)-approximations to sparsest cutFull-text access may be available. Sign in or learn about subscription options.pp. 363-372
by Jonah Sherman
A Complete Characterization of Statistical Query Learning with Applications to EvolvabilityFull-text access may be available. Sign in or learn about subscription options.
by Vitaly Feldman
Agnostic Learning of Monomials by Halfspaces Is HardFull-text access may be available. Sign in or learn about subscription options.
by Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, Yi Wu
Learning and Smoothed AnalysisFull-text access may be available. Sign in or learn about subscription options.
by Adam Tauman Kalai, Alex Samorodnitsky, Shang-Hua Teng
k-Means Has Polynomial Smoothed ComplexityFull-text access may be available. Sign in or learn about subscription options.
by David Arthur, Bodo Manthey, Heiko Röglin
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover DecompositionsFull-text access may be available. Sign in or learn about subscription options.
by Zeev Nutov
Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSPFull-text access may be available. Sign in or learn about subscription options.
by Aaron Archer, Mohammad Hossein Bateni, Mohammad Taghi Hajiaghayi, Howard Karloff
An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network DesignFull-text access may be available. Sign in or learn about subscription options.
by Julia Chuzhoy, Sanjeev Khanna
An Oblivious O(1)-Approximation for Single Source Buy-at-BulkFull-text access may be available. Sign in or learn about subscription options.
by Ashish Goel, Ian Post
Optimal Long Code Test with One Free BitFull-text access may be available. Sign in or learn about subscription options.
by Nikhil Bansal, Subhash Khot
Combinatorial PCPs with Efficient VerifiersFull-text access may be available. Sign in or learn about subscription options.
by Or Meir
Composition of Low-Error 2-Query PCPs Using Decodable PCPsFull-text access may be available. Sign in or learn about subscription options.
by Irit Dinur, Prahladh Harsha
The Complexity of Rationalizing Network FormationFull-text access may be available. Sign in or learn about subscription options.
by Shankar Kalyanaraman, Christopher Umans
Dynamic and Non-uniform Pricing Strategies for Revenue MaximizationFull-text access may be available. Sign in or learn about subscription options.
by Tanmoy Chakraborty, Zhiyi Huang, Sanjeev Khanna
On the Power of Randomization in Algorithmic Mechanism DesignFull-text access may be available. Sign in or learn about subscription options.
by Shahar Dobzinski, Shaddin Dughmi
Universal Blind Quantum ComputationFull-text access may be available. Sign in or learn about subscription options.
by Anne Broadbent, Joseph Fitzsimons, Elham Kashefi
Optimal Quantum Strong Coin FlippingFull-text access may be available. Sign in or learn about subscription options.
by André Chailloux, Iordanis Kerenidis
Two-Message Quantum Interactive Proofs Are in PSPACEFull-text access may be available. Sign in or learn about subscription options.
by Rahul Jain, Sarvagya Upadhyay, John Watrous
Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean FunctionFull-text access may be available. Sign in or learn about subscription options.
by Ben W. Reichardt
A Z_$(\log n)^{\Omega(1)}$_Z Integrality Gap for the Sparsest Cut SDPFull-text access may be available. Sign in or learn about subscription options.
by Jeff Cheeger, Bruce Kleiner, Assaf Naor
SDP Integrality Gaps with Local ell_1-EmbeddabilityFull-text access may be available. Sign in or learn about subscription options.
by Subhash Khot, Rishi Saket
Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMESFull-text access may be available. Sign in or learn about subscription options.
by Prasad Raghavendra, David Steurer
How to Round Any CSPFull-text access may be available. Sign in or learn about subscription options.
by Prasad Raghavendra, David Steurer
Constraint Satisfaction Problems of Bounded WidthFull-text access may be available. Sign in or learn about subscription options.
by Libor Barto, Marcin Kozik
Bit Encryption Is CompleteFull-text access may be available. Sign in or learn about subscription options.
by Steven Myers, Abhi Shelat
2-Source Extractors under Computational Assumptions and Cryptography with Defective RandomnessFull-text access may be available. Sign in or learn about subscription options.
by Yael Tauman Kalai, Xin Li, Anup Rao
(Meta) KernelizationFull-text access may be available. Sign in or learn about subscription options.
by Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos
Planarity Allowing Few Error Vertices in Linear TimeFull-text access may be available. Sign in or learn about subscription options.
by Ken-ichi Kawarabayashi
Symmetry and Approximability of Submodular Maximization ProblemsFull-text access may be available. Sign in or learn about subscription options.
by Jan Vondrák
Submodular Function Minimization under Covering ConstraintsFull-text access may be available. Sign in or learn about subscription options.
by Satoru Iwata, Kiyohito Nagano
Smoothed Analysis of Multiobjective OptimizationFull-text access may be available. Sign in or learn about subscription options.
by Heiko Röglin, Shang-Hua Teng
Fully dynamic (2 + ε) approximate all-pairs shortest paths with fast query and close to linear update timeFull-text access may be available. Sign in or learn about subscription options.pp. 693-702
by Aaron Bernstein
Distance Oracles for Sparse GraphsFull-text access may be available. Sign in or learn about subscription options.
by Christian Sommer, Elad Verbin, Wei Yu
Space-Efficient Framework for Top-k String Retrieval ProblemsFull-text access may be available. Sign in or learn about subscription options.
by Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
KKL, Kruskal-Katona, and Monotone NetsFull-text access may be available. Sign in or learn about subscription options.
by Ryan O'Donnell, Karl Wimmer
Higher Eigenvalues of GraphsFull-text access may be available. Sign in or learn about subscription options.
by Jonathan A. Kelner, James R. Lee, Gregory N. Price, Shang-Hua Teng
Regularity Lemmas and Combinatorial AlgorithmsFull-text access may be available. Sign in or learn about subscription options.
by Nikhil Bansal, Ryan Williams
Approximability of Combinatorial Problems with Multi-agent Submodular Cost FunctionsFull-text access may be available. Sign in or learn about subscription options.pp. 755-764
by Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei Wang
The Data Stream Space Complexity of Cascaded NormsFull-text access may be available. Sign in or learn about subscription options.
by T.S. Jayram, David P. Woodruff
Author indexFreely available from IEEE.
[Publisher's information]Freely available from IEEE.
Showing 82 out of 82