Table of Contents

• Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph SizeAnkur Moitra. 3-12 [doi]
• Faster Generation of Random Spanning TreesJonathan A. Kelner, Aleksander Madry. 13-21 [doi]
• Local Graph Partitions for Approximation and TestingAvinatan Hassidim, Jonathan A. Kelner, Huy N. Nguyen, Krzysztof Onak. 22-31 [doi]
• Oblivious Routing for the Lp-normMatthias Englert, Harald Räcke. 32-40 [doi]
• Linear Systems over Composite ModuliArkadev Chattopadhyay, Avi Wigderson. 43-52 [doi]
• Multiparty Communication Complexity and Threshold Circuit Size of AC^0Paul Beame, Dang-Trinh Huynh-Ngoc. 53-62 [doi]
• The Communication Complexity of Set-Disjointness with Small Sets and 0-1 IntersectionEyal Kushilevitz, Enav Weinreb. 63-72 [doi]
• Polynomial Hierarchy, Betti Numbers and a Real Analogue of Toda s TheoremSaugata Basu, Thierry Zell. 73-82 [doi]
• The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian ProblemsDaniel Gottesman, Sandy Irani. 95-104 [doi]
• On Allocating Goods to Maximize FairnessDeeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna. 107-116 [doi]
• Online Stochastic Matching: Beating 1-1/eJon Feldman, Aranyak Mehta, Vahab S. Mirrokni, S. Muthukrishnan. 117-126 [doi]
• Instance-Optimal Geometric AlgorithmsPeyman Afshani, Jérémy Barbay, Timothy M. Chan. 129-138 [doi]
• Delaunay Triangulations in O(sort(n)) Time and MoreKevin Buchin, Wolfgang Mulzer. 139-148 [doi]
• Orthogonal Range Reporting in Three and Higher DimensionsPeyman Afshani, Lars Arge, Kasper Dalgaard Larsen. 149-158 [doi]
• Decomposing Coverings and the Planar Sensor Cover ProblemMatt Gibson, Kasturi R. Varadarajan. 159-168 [doi]
• Bounded Independence Fools HalfspacesIlias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola. 171-180 [doi]
• Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and MergersZeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan. 181-190 [doi]
• Constructing Small-Bias Sets from Algebraic-Geometric CodesAvraham Ben-Aroya, Amnon Ta-Shma. 191-197 [doi]
• Blackbox Polynomial Identity Testing for Depth 3 CircuitsNeeraj Kayal, Shubhangi Saraf. 198-207 [doi]
• A New Probability Inequality Using Typical Moments and Concentration ResultsRavindran Kannan. 211-220 [doi]
• A Probabilistic Inequality with Applications to Threshold Direct-Product TheoremsFalk Unger. 221-229 [doi]
• Choice-Memory Tradeoff in AllocationsNoga Alon, Eyal Lubetzky, Ori Gurel-Gurevich. 230-238 [doi]
• A Parallel Repetition Theorem for Any Interactive ArgumentIftach Haitner. 241-250 [doi]
• Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation StrategyYi Deng, Vipul Goyal, Amit Sahai. 251-260 [doi]
• Extracting CorrelationsYuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai. 261-270 [doi]
• Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable UtilitiesXi Chen, Decheng Dai, Ye Du, Shang-Hua Teng. 273-282 [doi]
• Reducibility among Fractional Stability ProblemsShiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng. 283-292 [doi]
• Convergence of Local Dynamics to Balanced Outcomes in Exchange NetworksYossi Azar, Benjamin E. Birnbaum, L. Elisa Celis, Nikhil R. Devanur, Yuval Peres. 293-302 [doi]
• Convergence to Equilibrium in Local Interaction GamesAndrea Montanari, Amin Saberi. 303-312 [doi]
• Exact and Approximate Pattern Matching in the Streaming ModelBenny Porat, Ely Porat. 315-323 [doi]
• Efficient Sketches for Earth-Mover Distance, with ApplicationsAlexandr Andoni, Khanh Do Ba, Piotr Indyk, David P. Woodruff. 324-330 [doi]
• Models for the Compressible WebFlavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, Prabhakar Raghavan. 331-340 [doi]
• Breaking the Multicommodity Flow Barrier for O(vlog n)-Approximations to Sparsest CutJonah Sherman. 363-372 [doi]
• A Complete Characterization of Statistical Query Learning with Applications to EvolvabilityVitaly Feldman. 375-384 [doi]
• Agnostic Learning of Monomials by Halfspaces Is HardVitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, Yi Wu. 385-394 [doi]
• Learning and Smoothed AnalysisAdam Tauman Kalai, Alex Samorodnitsky, Shang-Hua Teng. 395-404 [doi]
• k-Means Has Polynomial Smoothed ComplexityDavid Arthur, Bodo Manthey, Heiko Röglin. 405-414 [doi]
• Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover DecompositionsZeev Nutov. 417-426 [doi]
• Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSPAaron Archer, MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Howard J. Karloff. 427-436 [doi]
• An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network DesignJulia Chuzhoy, Sanjeev Khanna. 437-441 [doi]
• An Oblivious O(1)-Approximation for Single Source Buy-at-BulkAshish Goel, Ian Post. 442-450 [doi]
• Optimal Long Code Test with One Free BitNikhil Bansal, Subhash Khot. 453-462 [doi]
• Combinatorial PCPs with Efficient VerifiersOr Meir. 463-471 [doi]
• Composition of Low-Error 2-Query PCPs Using Decodable PCPsIrit Dinur, Prahladh Harsha. 472-481 [doi]
• The Complexity of Rationalizing Network FormationShankar Kalyanaraman, Christopher Umans. 485-494 [doi]
• Dynamic and Non-uniform Pricing Strategies for Revenue MaximizationTanmoy Chakraborty, Zhiyi Huang, Sanjeev Khanna. 495-504 [doi]
• On the Power of Randomization in Algorithmic Mechanism DesignShahar Dobzinski, Shaddin Dughmi. 505-514 [doi]
• Universal Blind Quantum ComputationAnne Broadbent, Joseph Fitzsimons, Elham Kashefi. 517-526 [doi]
• Optimal Quantum Strong Coin FlippingAndré Chailloux, Iordanis Kerenidis. 527-533 [doi]
• Two-Message Quantum Interactive Proofs Are in PSPACERahul Jain, Sarvagya Upadhyay, John Watrous. 534-543 [doi]
• Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean FunctionBen Reichardt. 544-551 [doi]
• SDP Integrality Gaps with Local ell_1-EmbeddabilitySubhash Khot, Rishi Saket. 565-574 [doi]
• Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMESPrasad Raghavendra, David Steurer. 575-585 [doi]
• How to Round Any CSPPrasad Raghavendra, David Steurer. 586-594 [doi]
• Constraint Satisfaction Problems of Bounded WidthLibor Barto, Marcin Kozik. 595-603 [doi]
• Bit Encryption Is CompleteSteven Myers, Abhi Shelat. 607-616 [doi]
• 2-Source Extractors under Computational Assumptions and Cryptography with Defective RandomnessYael Tauman Kalai, Xin Li, Anup Rao. 617-626 [doi]
• (Meta) KernelizationHans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos. 629-638 [doi]
• Planarity Allowing Few Error Vertices in Linear TimeKen-ichi Kawarabayashi. 639-648 [doi]
• Symmetry and Approximability of Submodular Maximization ProblemsJan Vondrák. 651-670 [doi]
• Submodular Function Minimization under Covering ConstraintsSatoru Iwata, Kiyohito Nagano. 671-680 [doi]
• Smoothed Analysis of Multiobjective OptimizationHeiko Röglin, Shang-Hua Teng. 681-690 [doi]
• Fully Dynamic (2 + epsilon) Approximate All-Pairs Shortest Paths with Fast Query and Close to Linear Update TimeAaron Bernstein. 693-702 [doi]
• Distance Oracles for Sparse GraphsChristian Sommer 0002, Elad Verbin, Wei Yu. 703-712 [doi]
• Space-Efficient Framework for Top-k String Retrieval ProblemsWing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter. 713-722 [doi]
• KKL, Kruskal-Katona, and Monotone NetsRyan O Donnell, Karl Wimmer. 725-734 [doi]
• Higher Eigenvalues of GraphsJonathan A. Kelner, James R. Lee, Gregory N. Price, Shang-Hua Teng. 735-744 [doi]
• Regularity Lemmas and Combinatorial AlgorithmsNikhil Bansal, Ryan Williams. 745-754 [doi]
• Approximability of Combinatorial Problems with Multi-agent Submodular Cost FunctionsGagan Goel, Chinmay Karande, Pushkar Tripathi, Lei Wang. 755-764 [doi]
• The Data Stream Space Complexity of Cascaded NormsT. S. Jayram, David P. Woodruff. 765-774 [doi]