[Front cover]

Title Page i (PDF)

pp. i

Title Page iii (PDF)

pp. iii

[Copyright notice] (PDF)

pp. iv

Table of contents (PDF)

pp. v-xi

Foreword (PDF)

pp. xii

Organizing Committee (PDF)

pp. xiii

Program Committee (PDF)

pp. xiv

Reviewers (PDF)

pp. xv-xvi

Awards (PDF)

pp. xvii

The Promise of Differential Privacy: A Tutorial on Algorithmic Techniques (Abstract)

Cynthia Dwork

pp. 1-2

PDF

Green Computing Algorithmics (Abstract)

Kirk Pruhs

pp. 3-4

PDF

Computing Blindfolded: New Developments in Fully Homomorphic Encryption (Abstract)

Vinod Vaikuntanathan

pp. 5-16

PDF

Min-max Graph Partitioning and Small Set Expansion (Abstract)

Nikhil Bansal

Uriel Feige

Robert Krauthgamer

Konstantin Makarychev

pp. 17-26

PDF

The Graph Minor Algorithm with Parity Conditions (Abstract)

Ken-ichi Kawarabayashi

Bruce Reed

Paul Wollan

pp. 27-36

PDF

Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications (Abstract)

Christian Wulff-Nilsen

pp. 37-46

PDF

A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths (Abstract)

pp. 47-56

PDF

How Bad is Forming Your Own Opinion? (Abstract)

pp. 57-66

PDF

Christos H. Papadimitriou

The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions (Abstract)

Paul W. Goldberg

Rahul Savani

pp. 67-76

PDF

Welfare and Profit Maximization with Production Costs (Abstract)

pp. 77-86

PDF

Mechanism Design with Set-Theoretic Beliefs (Abstract)

Jing Chen

Silvio Micali

pp. 87-96

PDF

Efficient Fully Homomorphic Encryption from (Standard) LWE (Abstract)

Zvika Brakerski

Vinod Vaikuntanathan

pp. 97-106

PDF

Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits (Abstract)

Craig Gentry

Shai Halevi

pp. 107-109

PDF

Coin Flipping with Constant Bias Implies One-Way Functions (Abstract)

Iftach Haitner

Eran Omri

pp. 110-119

PDF

How to Garble Arithmetic Circuits (Abstract)

pp. 120-129

PDF

Sharp Mixing Time Bounds for Sampling Random Surfaces (Abstract)

Pietro Caputo

Fabio Martinelli

Fabio Lucio Toninelli

pp. 130-139

PDF

Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets (Abstract)

pp. 140-149

PDF

Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time (Abstract)

Jakub Onufry Wojtaszczyk

pp. 150-159

PDF

The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable (Abstract)

Ken-ichi Kawarabayashi

Mikkel Thorup

pp. 160-169

PDF

Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time (Abstract)

Christian Wulff-Nilsen

pp. 170-179

PDF

Virginia Vassilevska Williams

Minimum Weight Cycles and Triangles: Equivalences and Algorithms (Abstract)

Liam Roditty

pp. 180-189

PDF

Graph Connectivities, Network Coding, and Expander Graphs (Abstract)

pp. 190-199

PDF

Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2 (Abstract)

Loïc Séguin-Charbonneau

F. Bruce Shepherd

pp. 200-209

PDF

Online Node-Weighted Steiner Tree and Related Problems (Abstract)

pp. 210-219

PDF

Extractors for Circuit Sources (Abstract)

Emanuele Viola

pp. 220-229

PDF

Randomness Buys Depth for Approximate Counting (Abstract)

Emanuele Viola

pp. 230-239

PDF

Periklis A. Papakonstaninou

Pseudorandomness for Read-Once Formulas (Abstract)

Andrej Bogdanov

Andrew Wan

pp. 240-246

PDF

Dispersers for Affine Sources with Sub-polynomial Entropy (Abstract)

Ronen Shaltiel

pp. 247-256

PDF

A Small PRG for Polynomial Threshold Functions of Gaussians (Abstract)

Daniel M. Kane

pp. 257-266

PDF

A Polylogarithmic-Competitive Algorithm for the k-Server Problem (Abstract)

pp. 267-276

PDF

3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General (Abstract)

Timon Hertli

pp. 277-284

PDF

On the Power of Adaptivity in Sparse Recovery (Abstract)

pp. 285-294

PDF

(1 + eps)-Approximate Sparse Recovery (Abstract)

Eric Price

David P. Woodruff

pp. 295-304

PDF

Near Optimal Column-Based Matrix Reconstruction (Abstract)

pp. 305-314

PDF

Near Linear Lower Bound for Dimension Reduction in L1 (Abstract)

pp. 315-323

PDF

The 1D Area Law and the Complexity of Quantum States: A Combinatorial Approach (Abstract)

pp. 324-333

PDF

On the Complexity of Commuting Local Hamiltonians, and Tight Conditions for Topological Order in Such Systems (Abstract)

Dorit Aharonov

Lior Eldar

pp. 334-343

PDF

Quantum Query Complexity of State Conversion (Abstract)

pp. 344-353

PDF

Optimal Bounds for Quantum Bit Commitment (Abstract)

André Chailloux

Iordanis Kerenidis

pp. 354-362

PDF

Streaming Algorithms via Precision Sampling (Abstract)

pp. 363-372

PDF

Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones (Abstract)

Michael Elkin

Shay Solomon

pp. 373-382

PDF

Fully Dynamic Maximal Matching in O (log n) Update Time (Abstract)

pp. 383-392

PDF

Which Networks are Least Susceptible to Cascading Failures? (Abstract)

pp. 393-402

PDF

The Power of Linear Estimators (Abstract)

Gregory Valiant

Paul Valiant

pp. 403-412

PDF

An Algebraic Proof of a Robust Social Choice Impossibility Theorem (Abstract)

Dvir Falik

Ehud Friedgut

pp. 413-422

PDF

Planar Graphs: Random Walks and Bipartiteness Testing (Abstract)

pp. 423-432

PDF

Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy (Abstract)

Madhav Jha

Sofya Raskhodnikova

pp. 433-442

PDF

How to Play Unique Games Against a Semi-random Adversary: Study of Semi-random Models of Unique Games (Abstract)

Alexandra Kolla

Konstantin Makarychev

Yury Makarychev

pp. 443-452

PDF

The Grothendieck Constant is Strictly Smaller than Krivine's Bound (Abstract)

Mark Braverman

Konstantin Makarychev

Yury Makarychev

Assaf Naor

pp. 453-462

PDF

A Parallel Approximation Algorithm for Positive Semidefinite Programming (Abstract)

Rahul Jain

Penghui Yao

pp. 463-471

PDF

Rounding Semidefinite Programming Hierarchies via Global Correlation (Abstract)

pp. 472-481

PDF

Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives (Abstract)

Venkatesan Guruswami

Ali Kemal Sinop

pp. 482-491

PDF

Markov Layout (Abstract)

pp. 492-501

PDF

Limitations of Randomized Mechanisms for Combinatorial Auctions (Abstract)

Shaddin Dughmi

Jan Vondr´k

pp. 502-511

PDF

Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many Buyers (Abstract)

Saeed Alaei

pp. 512-521

PDF

Extreme-Value Theorems for Optimal Multidimensional Pricing (Abstract)

Yang Cai

Constantinos Daskalakis

pp. 522-531

PDF

Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games (Abstract)

pp. 532-541

PDF

On Range Searching in the Group Model and Combinatorial Discrepancy (Abstract)

Kasper Green Larsen

pp. 542-549

PDF

A Randomized Rounding Approach to the Traveling Salesman Problem (Abstract)

pp. 550-559

PDF

Approximating Graphic TSP by Matchings (Abstract)

Tobias Möemke

Ola Svensson

pp. 560-569

PDF

A Unified Continuous Greedy Algorithm for Submodular Maximization (Abstract)

pp. 570-579

PDF

Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings (Abstract)

pp. 580-589

PDF

A Nearly-m log n Time Solver for SDD Linear Systems (Abstract)

pp. 590-598

PDF

Balls and Bins: Smaller Hash Families and Faster Evaluation (Abstract)

pp. 599-608

PDF

Lexicographic Products and the Power of Non-linear Network Coding (Abstract)

pp. 609-618

PDF

Quadratic Goldreich-Levin Theorems (Abstract)

Madhur Tulsiani

Julia Wolf

pp. 619-628

PDF

Optimal Testing of Multivariate Polynomials over Small Prime Fields (Abstract)

pp. 629-637

PDF

Tight Lower Bounds for 2-query LCCs over Finite Fields (Abstract)

pp. 638-647

PDF

A Two Prover One Round Game with Strong Soundness (Abstract)

Subhash Khot

Muli Safra

pp. 648-657

PDF

The Randomness Complexity of Parallel Repetition (Abstract)

Kai-Min Chung

Rafael Pass

pp. 658-667

PDF

Privacy Amplification and Non-malleable Extractors via Character Sums (Abstract)

Xin Li

pp. 668-677

PDF

Stateless Cryptographic Protocols (Abstract)

Vipul Goyal

Hemanta K. Maji

pp. 678-687

PDF

Storing Secrets on Continually Leaky Devices (Abstract)

pp. 688-697

PDF

Medium Access Using Queues (Abstract)

pp. 698-707

PDF

Local Distributed Decision (Abstract)

pp. 708-717

PDF

The Complexity of Renaming (Abstract)

pp. 718-727

PDF

Mutual Exclusion with O(log^2 Log n) Amortized Work (Abstract)

Michael A. Bender

Seth Gilbert

pp. 728-737

PDF

Algorithms for the Generalized Sorting Problem (Abstract)

pp. 738-747

PDF

Information Equals Amortized Communication (Abstract)

Mark Braverman

Anup Rao

pp. 748-757

PDF

Delays and the Capacity of Continuous-Time Channels (Abstract)

Sanjeev Khanna

Madhu Sudan

pp. 758-767

PDF

Efficient and Explicit Coding for Interactive Communication (Abstract)

pp. 768-777

PDF

Efficient Reconstruction of Random Multilinear Formulas (Abstract)

pp. 778-787

PDF

New Extension of the Weil Bound for Character Sums with Applications to Coding (Abstract)

Tali Kaufman

Shachar Lovett

pp. 788-796

PDF

Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems (Abstract)

Jian Li

Amol Deshpande

pp. 797-806

PDF

Approximation Algorithms for Submodular Multiway Partition (Abstract)

Chandra Chekuri

Alina Ene

pp. 807-816

PDF

An FPTAS for #Knapsack and Related Counting Problems (Abstract)

pp. 817-826

PDF

Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits (Abstract)

Anupam Gupta

Ravishankar Krishnaswamy

Marco Molinaro

R. Ravi

pp. 827-836

PDF

Evolution with Recombination (Abstract)

Varun Kanade

pp. 837-846

PDF

Author Index (PDF)

pp. 847-849

[Publishers information] (PDF)

pp. 850