CSDL - Proceedings F

Title page i (PDF)

pp. i

Title Page iii (PDF)

pp. iii

pp. iv

Table of Contents (PDF)

pp. v-x

Message from Program Chair (PDF)

pp. xi

Organizing Committee (PDF)

pp. xii

Reviewers (PDF)

pp. xiii-xiv

Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size (Abstract)

Ankur Moitra

pp. 3-12

PDF

Faster Generation of Random Spanning Trees (Abstract)

Jonathan A. Kelner

Aleksander Madry

pp. 13-21

PDF

Local Graph Partitions for Approximation and Testing (Abstract)

pp. 22-31

PDF

Oblivious Routing for the Lp-norm (Abstract)

Matthias Englert

Harald Räcke

pp. 32-40

PDF

Linear Systems over Composite Moduli (Abstract)

Arkadev Chattopadhyay

Avi Wigderson

pp. 43-52

PDF

Multiparty Communication Complexity and Threshold Circuit Size of AC^0 (Abstract)

Paul Beame

Dang-Trinh Huynh-Ngoc

pp. 53-62

PDF

The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection (Abstract)

Eyal Kushilevitz

Enav Weinreb

pp. 63-72

PDF

Polynomial Hierarchy, Betti Numbers and a Real Analogue of Toda's Theorem (Abstract)

Saugata Basu

Thierry Zell

pp. 73-82

PDF

Randomized Self-Assembly for Exact Shapes (Abstract)

David Doty

pp. 85-94

PDF

The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems (Abstract)

Daniel Gottesman

Sandy Irani

pp. 95-104

PDF

On Allocating Goods to Maximize Fairness (Abstract)

Deeparnab Chakrabarty

Julia Chuzhoy

Sanjeev Khanna

pp. 107-116

PDF

Online Stochastic Matching: Beating 1-1/e (Abstract)

pp. 117-126

PDF

Instance-Optimal Geometric Algorithms (Abstract)

pp. 129-138

PDF

Delaunay Triangulations in O(sort(n)) Time and More (Abstract)

Kevin Buchin

Wolfgang Mulzer

pp. 139-148

PDF

Orthogonal Range Reporting in Three and Higher Dimensions (Abstract)

Peyman Afshani

Lars Arge

Kasper Dalgaard Larsen

pp. 149-158

PDF

Decomposing Coverings and the Planar Sensor Cover Problem (Abstract)

Matt Gibson

Kasturi Varadarajan

pp. 159-168

PDF

Bounded Independence Fools Halfspaces (Abstract)

pp. 171-180

PDF

Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers (Abstract)

pp. 181-190

PDF

Constructing Small-Bias Sets from Algebraic-Geometric Codes (Abstract)

Avraham Ben-Aroya

Amnon Ta-Shma

pp. 191-197

PDF

Blackbox Polynomial Identity Testing for Depth 3 Circuits (Abstract)

Neeraj Kayal

Shubhangi Saraf

pp. 198-207

PDF

A New Probability Inequality Using Typical Moments and Concentration Results (Abstract)

Ravindran Kannan

pp. 211-220

PDF

A Probabilistic Inequality with Applications to Threshold Direct-Product Theorems (Abstract)

Falk Unger

pp. 221-229

PDF

Choice-Memory Tradeoff in Allocations (Abstract)

pp. 230-238

PDF

A Parallel Repetition Theorem for Any Interactive Argument (Abstract)

Iftach Haitner

pp. 241-250

PDF

Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy (Abstract)

Yi Deng

Vipul Goyal

Amit Sahai

pp. 251-260

PDF

Extracting Correlations (Abstract)

pp. 261-270

PDF

Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities (Abstract)

Xi Chen

Decheng Dai

Ye Du

Shang-Hua Teng

pp. 273-282

PDF

Reducibility among Fractional Stability Problems (Abstract)

pp. 283-292

PDF

Convergence of Local Dynamics to Balanced Outcomes in Exchange Networks (Abstract)

pp. 293-302

PDF

Convergence to Equilibrium in Local Interaction Games (Abstract)

Andrea Montanari

Amin Saberi

pp. 303-312

PDF

Exact and Approximate Pattern Matching in the Streaming Model (Abstract)

Benny Porat

Ely Porat

pp. 315-323

PDF

Efficient Sketches for Earth-Mover Distance, with Applications (Abstract)

pp. 324-330

PDF

Models for the Compressible Web (Abstract)

pp. 331-340

PDF

The Intersection of Two Halfspaces Has High Threshold Degree (Abstract)

Alexander A. Sherstov

pp. 343-362

PDF

Breaking the Multicommodity Flow Barrier for O(vlog n)-Approximations to Sparsest Cut (Abstract)

Jonah Sherman

pp. 363-372

PDF

A Complete Characterization of Statistical Query Learning with Applications to Evolvability (Abstract)

Vitaly Feldman

pp. 375-384

PDF

Agnostic Learning of Monomials by Halfspaces Is Hard (Abstract)

Vitaly Feldman

Venkatesan Guruswami

Prasad Raghavendra

Yi Wu

pp. 385-394

PDF

Learning and Smoothed Analysis (Abstract)

pp. 395-404

PDF

k-Means Has Polynomial Smoothed Complexity (Abstract)

pp. 405-414

PDF

Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions (Abstract)

Zeev Nutov

pp. 417-426

PDF

Mohammad Taghi Hajiaghayi

Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP (Abstract)

Aaron Archer

Mohammad Hossein Bateni

Howard Karloff

pp. 427-436

PDF

An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design (Abstract)

Julia Chuzhoy

Sanjeev Khanna

pp. 437-441

PDF

An Oblivious O(1)-Approximation for Single Source Buy-at-Bulk (Abstract)

Ashish Goel

Ian Post

pp. 442-450

PDF

Optimal Long Code Test with One Free Bit (Abstract)

Nikhil Bansal

Subhash Khot

pp. 453-462

PDF

Combinatorial PCPs with Efficient Verifiers (Abstract)

Or Meir

pp. 463-471

PDF

Composition of Low-Error 2-Query PCPs Using Decodable PCPs (Abstract)

Irit Dinur

Prahladh Harsha

pp. 472-481

PDF

The Complexity of Rationalizing Network Formation (Abstract)

Shankar Kalyanaraman

Christopher Umans

pp. 485-494

PDF

Dynamic and Non-uniform Pricing Strategies for Revenue Maximization (Abstract)

pp. 495-504

PDF

On the Power of Randomization in Algorithmic Mechanism Design (Abstract)

Shahar Dobzinski

Shaddin Dughmi

pp. 505-514

PDF

Universal Blind Quantum Computation (Abstract)

pp. 517-526

PDF

Optimal Quantum Strong Coin Flipping (Abstract)

André Chailloux

Iordanis Kerenidis

pp. 527-533

PDF

Two-Message Quantum Interactive Proofs Are in PSPACE (Abstract)

pp. 534-543

PDF

Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function (Abstract)

Ben W. Reichardt

pp. 544-551

PDF

A $(\log n)^{\Omega(1)}$ Integrality Gap for the Sparsest Cut SDP (Abstract)

pp. 555-564

PDF

SDP Integrality Gaps with Local ell_1-Embeddability (Abstract)

Subhash Khot

Rishi Saket

pp. 565-574

PDF

Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES (Abstract)

Prasad Raghavendra

David Steurer

pp. 575-585

PDF

How to Round Any CSP (Abstract)

Prasad Raghavendra

David Steurer

pp. 586-594

PDF

Constraint Satisfaction Problems of Bounded Width (Abstract)

Libor Barto

Marcin Kozik

pp. 595-603

PDF

Bit Encryption Is Complete (Abstract)

Steven Myers

Abhi Shelat

pp. 607-616

PDF

2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness (Abstract)

Yael Tauman Kalai

Xin Li

Anup Rao

pp. 617-626

PDF

(Meta) Kernelization (Abstract)

Dimitrios M. Thilikos

pp. 629-638

PDF

Planarity Allowing Few Error Vertices in Linear Time (Abstract)

Ken-ichi Kawarabayashi

pp. 639-648

PDF

Symmetry and Approximability of Submodular Maximization Problems (Abstract)

Jan Vondrák

pp. 651-670

PDF

Submodular Function Minimization under Covering Constraints (Abstract)

Satoru Iwata

Kiyohito Nagano

pp. 671-680

PDF

Smoothed Analysis of Multiobjective Optimization (Abstract)

Heiko Röglin

Shang-Hua Teng

pp. 681-690

PDF

Fully Dynamic (2 + epsilon) Approximate All-Pairs Shortest Paths with Fast Query and Close to Linear Update Time (Abstract)

Aaron Bernstein

pp. 693-702

PDF

Distance Oracles for Sparse Graphs (Abstract)

Christian Sommer

Elad Verbin

Wei Yu

pp. 703-712

PDF

Space-Efficient Framework for Top-k String Retrieval Problems (Abstract)

pp. 713-722

PDF

KKL, Kruskal-Katona, and Monotone Nets (Abstract)

Ryan O'Donnell

Karl Wimmer

pp. 725-734

PDF

Higher Eigenvalues of Graphs (Abstract)

pp. 735-744

PDF

Regularity Lemmas and Combinatorial Algorithms (Abstract)

Nikhil Bansal

Ryan Williams

pp. 745-754

PDF

Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions (Abstract)

pp. 755-764

PDF

The Data Stream Space Complexity of Cascaded Norms (Abstract)

T.S. Jayram

David P. Woodruff

pp. 765-774

PDF

Author Index (PDF)

pp. 775-777

Publisher's Information (PDF)

pp. 778