[Front cover]

[Copyright notice] (PDF)

pp. iv

Table of contents (PDF)

pp. v-xi

list-reviewer (PDF)

pp. xiv-xvi

Title Page i (PDF)

pp. i

Title Page iii (PDF)

pp. iii

Foreword (PDF)

pp. xii

Committees (PDF)

pp. xiii

The Polynomial Method in Quantum and Classical Computing (Abstract)

Scott Aaronson

pp. 3

PDF

Theory of Sponsored Search Auctions (Abstract)

Gagan Aggarwal

S. Muthukrishnan

pp. 7

PDF

Average-case Complexity (Abstract)

Luca Trevisan

pp. 11

PDF

Truthful Approximation Schemes for Single-Parameter Agents (Abstract)

Peerapong Dhangwatnotai

pp. 15-24

PDF

Christos H. Papadimitriou

Discretized Multinomial Distributions and Nash Equilibria in Anonymous Games (Abstract)

Constantinos Daskalakis

pp. 25-34

PDF

Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply (Abstract)

Maurice Cheung

Chaitanya Swamy

pp. 35-44

PDF

Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents (Abstract)

Nikhil R. Devanur

Ravi Kannan

pp. 45-53

PDF

The Sign-Rank of AC^O (Abstract)

Alexander A. Razborov

Alexander A. Sherstov

pp. 57-66

PDF

Arithmetic Circuits: A Chasm at Depth Four (Abstract)

Manindra Agrawal

V. Vinay

pp. 67-75

PDF

Dense Subsets of Pseudorandom Sets (Abstract)

pp. 76-85

PDF

Almost-Natural Proofs (Abstract)

Timothy Y. Chow

pp. 86-91

PDF

Dynamic Connectivity: Connecting to Networks and Geometry (Abstract)

pp. 95-104

PDF

Algorithms for Single-Source Vertex Connectivity (Abstract)

Julia Chuzhoy

Sanjeev Khanna

pp. 105-114

PDF

A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest (Abstract)

pp. 115-124

PDF

Degree Bounded Network Design with Metric Costs (Abstract)

pp. 125-134

PDF

Matrix Sparsification for Rank and Determinant Computations via Nested Dissection (Abstract)

Raphael Yuster

pp. 137-145

PDF

Fast Modular Composition in any Characteristic (Abstract)

Kiran S. Kedlaya

Christopher Umans

pp. 146-155

PDF

Gaussian Bounds for Noise Correlation of Functions and Tight Analysis of Long Codes (Abstract)

Elchanan Mossel

pp. 156-165

PDF

Worst Case to Average Case Reductions for Polynomials (Abstract)

Tali Kaufman

Shachar Lovett

pp. 166-175

PDF

On the Union of Cylinders in Three Dimensions (Abstract)

Esther Ezra

pp. 179-188

PDF

Spherical Cubes and Rounding in High Dimensions (Abstract)

pp. 189-198

PDF

Near-Optimal Sparse Recovery in the L1 Norm (Abstract)

Piotr Indyk

Milan Ruzic

pp. 199-207

PDF

On Basing Lower-Bounds for Learning on Worst-Case Assumptions (Abstract)

pp. 211-220

PDF

The Bayesian Learner is Optimal for Noisy Binary Search (Abstract)

Michael Ben-Or

Avinatan Hassidim

pp. 221-230

PDF

Hardness of Minimizing and Learning DNF Expressions (Abstract)

Subhash Khot

Rishi Saket

pp. 231-240

PDF

Elections Can be Manipulated Often (Abstract)

pp. 243-249

PDF

On the Hardness of Being Truthful (Abstract)

Christos Papadimitriou

Michael Schapira

Yaron Singer

pp. 250-259

PDF

Multi-unit Auctions with Budget Limits (Abstract)

pp. 260-269

PDF

Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors (Abstract)

Ran Raz

Amir Yehudayoff

pp. 273-282

PDF

Periklis Papakonstantinou

On the Impossibility of Basing Identity Based Encryption on Trapdoor Permutations (Abstract)

Dan Boneh

pp. 283-292

PDF

Leakage-Resilient Cryptography (Abstract)

Stefan Dziembowski

Krzysztof Pietrzak

pp. 293-302

PDF

Succincter (Abstract)

Mihai Patrascu

pp. 305-313

PDF

Two Query PCP with Sub-Constant Error (Abstract)

Dana Moshkovitz

Ran Raz

pp. 314-323

PDF

Constant-Time Approximation Algorithms via Local Improvements (Abstract)

Huy N. Nguyen

Krzysztof Onak

pp. 327-336

PDF

Some Results on Greedy Embeddings in Metric Spaces (Abstract)

Ankur Moitra

Tom Leighton

pp. 337-346

PDF

Set Covering with our Eyes Closed (Abstract)

pp. 347-356

PDF

Minimizing Movement in Mobile Facility Location Problems (Abstract)

Zachary Friggstad

Mohammad R. Salavatipour

pp. 357-366

PDF

A Counterexample to Strong Parallel Repetition (Abstract)

Ran Raz

pp. 369-373

PDF

Rounding Parallel Repetitions of Unique Games (Abstract)

pp. 374-383

PDF

The Unbounded-Error Communication Complexity of Symmetric Functions (Abstract)

Alexander A. Sherstov

pp. 384-393

PDF

Lower Bounds for Noisy Wireless Networks using Sampling Algorithms (Abstract)

Chinmoy Dutta

Jaikumar Radhakrishnan

pp. 394-402

PDF

Inapproximability for Metric Embeddings into R^d (Abstract)

Jiri Matousek

Anastasios Sidiropoulos

pp. 405-413

PDF

A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match (Abstract)

pp. 414-423

PDF

Hardness of Nearest Neighbor under L-infinity (Abstract)

pp. 424-433

PDF

(Data) STRUCTURES (Abstract)

Mihai Patrascu

pp. 434-443

PDF

Entangled Games are Hard to Approximate (Abstract)

pp. 447-456

PDF

Unique Games with Entangled Provers are Easy (Abstract)

pp. 457-466

PDF

Quantum Multi Prover Interactive Proofs with Communicating Provers (Abstract)

pp. 467-476

PDF

A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs (Abstract)

pp. 477-486

PDF

Sketching and Streaming Entropy via Approximation Theory (Abstract)

pp. 489-498

PDF

On the Value of Multiple Read/Write Streams for Approximating Frequency Moments (Abstract)

Paul Beame

Dang-Trinh Huynh-Ngoc

pp. 499-508

PDF

Clock Synchronization with Bounded Global and Local Skew (Abstract)

pp. 509-518

PDF

Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners (Abstract)

pp. 519-528

PDF

Shiva Prasad Kasiviswanathan

What Can We Learn Privately? (Abstract)

pp. 531-540

PDF

Learning Geometric Concepts via Gaussian Surface Area (Abstract)

pp. 541-550

PDF

Isotropic PCA and Affine-Invariant Clustering (Abstract)

Spencer Charles Brubaker

Santosh Vempala

pp. 551-560

PDF

Approximate Kernel Clustering (Abstract)

Subhash Khot

Assaf Naor

pp. 561-570

PDF

Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph (Abstract)

pp. 573-582

PDF

(Acyclic) Job Shops are Hard to Approximate (Abstract)

Monaldo Mastrolilli

Ola Svensson

pp. 583-592

PDF

Linear Level Lasserre Lower Bounds for Certain k-CSPs (Abstract)

Grant Schoenebeck

pp. 593-602

PDF

The Power of Reordering for Online Minimum Makespan Scheduling (Abstract)

pp. 603-612

PDF

Locally Testing Direct Product in the Low Error Range (Abstract)

Irit Dinur

Elazar Goldenberg

pp. 613-622

PDF

Kakeya Sets, New Mergers and Old Extractors (Abstract)

Zeev Dvir

Avi Wigderson

pp. 625-633

PDF

A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems (Abstract)

Siu On Chan

Michael Molloy

pp. 634-643

PDF

Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness (Abstract)

pp. 644-653

PDF

Network Extractor Protocols (Abstract)

Xin Li

pp. 654-663

PDF

[Roster] (PDF)

pp. 836

Isomorhism of Hypergraphs of Low Rank in Moderately Exponential Time (Abstract)

Laszlo Babai

Paolo Codenotti

pp. 667-676

PDF

Computing the Tutte Polynomial in Vertex-Exponential Time (Abstract)

pp. 677-686

PDF

On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP (Abstract)

Deeparnab Chakrabarty

Gagan Goel

pp. 687-696

PDF

Submodular Approximation: Sampling-based Algorithms and Lower Bounds (Abstract)

Zoya Svitkina

Lisa Fleischer

pp. 697-706

PDF

Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution (Abstract)

Eli Ben-Sasson

Jakob Nordström

pp. 709-718

PDF

Noise Tolerance of Expanders and Sublinear Expander Reconstruction (Abstract)

pp. 719-728

PDF

Sequence Length Requirement of Distance-Based Phylogeny Reconstruction: Breaking the Polynomial Barrier (Abstract)

Sébastien Roch

pp. 729-738

PDF

Size Bounds and Query Plans for Relational Joins (Abstract)

pp. 739-748

PDF

Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows (Abstract)

pp. 751-760

PDF

Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums (Abstract)

pp. 761-770

PDF

A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width (Abstract)

Ken-ichi Kawarabayashi

Bojan Mohar

Bruce Reed

pp. 771-780

PDF

Nearly Tight Low Stretch Spanning Trees (Abstract)

pp. 781-790

PDF

Algorithmic Barriers from Phase Transitions (Abstract)

Dimitris Achlioptas

Amin Coja-Oghlan

pp. 793-802

PDF

Mixing Time of Exponential Random Graphs (Abstract)

pp. 803-812

PDF

k-Wise Independent Random Graphs (Abstract)

Noga Alon

Asaf Nussboim

pp. 813-822

PDF

Broadcasting with Side Information (Abstract)

pp. 823-832

PDF

Author Index (PDF)

pp. 833-835