CSDL - Proceedings F

48th Annual IEEE Symposium on Foundations of Computer Science - Title (PDF)

pp. i-iii

48th Annual IEEE Symposium on Foundations of Computer Science - Copyright (PDF)

pp. iv

48th Annual IEEE Symposium on Foundations of Computer Science - TOC (PDF)

pp. v-x

Introduction

Forward (PDF)

pp. xi

Conference Organization (PDF)

pp. xii

Reviewers (PDF)

pp. xiii

Tutorial 1

Structure and Randomness in Combinatorics (Abstract)

Terence Tao

pp. 3-15

PDF

Tutorial 2

A Brief Look at Pairings Based Cryptography (Abstract)

Dan Boneh

pp. 19-26

PDF

Tutorial 3

Spectral Graph Theory and its Applications (Abstract)

Daniel A. Spielman

pp. 29-38

PDF

Session 1

Pseudorandom Bits for Polynomials (Abstract)

Andrej Bogdanov

Emanuele Viola

pp. 41-51

PDF

Extractors and Rank Extractors for Polynomial Sources (Abstract)

pp. 52-62

PDF

Polylogarithmic Independence Can Fool DNF Formulas (Abstract)

Louay M.J. Bazzi

pp. 63-73

PDF

Derandomization of Sparse Cyclotomic Integer Zero Testing (Abstract)

Qi Cheng

pp. 74-80

PDF

Session 2

Computing Equilibria in Anonymous Games (Abstract)

Constantinos Daskalakis

Christos Papadimitriou

pp. 83-93

PDF

Mechanism Design via Differential Privacy (Abstract)

Frank McSherry

Kunal Talwar

pp. 94-103

PDF

Balloon Popping With Applications to Ascending Auctions (Abstract)

pp. 104-112

PDF

On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract) (Abstract)

Kousha Etessami

Mihalis Yannakakis

pp. 113-123

PDF

Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation (Abstract)

Xi Chen

Shang-Hua Teng

pp. 124-134

PDF

Session 3

Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling (Abstract)

Philipp Hertel

Toniann Pitassi

pp. 137-149

PDF

Parameterized Proof Complexity (Abstract)

pp. 150-160

PDF

Non-Linear Index Coding Outperforming the Linear Optimum (Abstract)

Eyal Lubetzky

Uri Stav

pp. 161-168

PDF

Can you beat treewidth? (Abstract)

Dániel Marx

pp. 169-179

PDF

Session 4

Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting (Abstract)

pp. 183-193

PDF

Reconstruction for Models on Random Graphs (Abstract)

Antoine Gerschenfeld

Andrea Montanari

pp. 194-204

PDF

Mixing Time Power Laws at Criticality (Abstract)

pp. 205-214

PDF

Near Optimal Bounds for Collision in Pollard Rho for Discrete Log (Abstract)

pp. 215-223

PDF

Session 5

Intrusion-Resilient Secret Sharing (Abstract)

Stefan Dziembowski

Krzysztof Pietrzak

pp. 227-237

PDF

Covert Multi-Party Computation (Abstract)

pp. 238-248

PDF

Cryptography from Sunspots: How to Use an Imperfect Reference String (Abstract)

pp. 249-259

PDF

Session 6

Planning for Fast Connectivity Updates (Abstract)

Mihai Patrascu

Mikkel Thorup

pp. 263-271

PDF

Strongly History-Independent Hashing with Applications (Abstract)

Guy E. Blelloch

Daniel Golovin

pp. 272-282

PDF

Smooth Histograms for Sliding Windows (Abstract)

Vladimir Braverman

Rafail Ostrovsky

pp. 283-293

PDF

Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence (Abstract)

Anna Gál

Parikshit Gopalan

pp. 294-304

PDF

Session 7

Towards Sharp Inapproximability For Any 2-CSP (Abstract)

Per Austrin

pp. 307-317

PDF

Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies (Abstract)

Subhash Khot

Assaf Naor

pp. 318-328

PDF

Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling (Abstract)

pp. 329-337

PDF

On the Optimality of Planar and Geometric Approximation Schemes (Abstract)

Dániel Marx

pp. 338-348

PDF

Hardness of Reconstructing Multivariate Polynomials over Finite Fields (Abstract)

pp. 349-359

PDF

Session 8

Any AND-OR Formula of Size N can be Evaluated in time N^{1/2 + o(1)} on a Quantum Computer (Abstract)

pp. 363-372

PDF

The Power of Quantum Systems on a Line (Abstract)

pp. 373-383

PDF

Simulating Quantum Correlations with Finite Communication (Abstract)

Oded Regev

Ben Toner

pp. 384-394

PDF

Quantum Algorithms for Hidden Nonlinear Structures (Abstract)

pp. 395-404

PDF

Session 9

Refuting Smoothed 3CNF Formulas (Abstract)

Uriel Feige

pp. 407-417

PDF

Hardness Amplification for Errorless Heuristics (Abstract)

Andrej Bogdanov

Muli Safra

pp. 418-426

PDF

One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications (Abstract)

Emanuele Viola

Avi Wigderson

pp. 427-437

PDF

A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits (Abstract)

Ran Raz

Amir Shpilka

Amir Yehudayoff

pp. 438-448

PDF

Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits (Abstract)

Arkadev Chattopadhyay

pp. 449-458

PDF

Session 10

Maximizing Non-Monotone Submodular Functions (Abstract)

pp. 461-471

PDF

On the Hardness and Smoothed Complexity of Quasi-Concave Minimization (Abstract)

Jonathan A. Kelner

Evdokia Nikolova

pp. 472-482

PDF

Approximation Algorithms for Partial-Information Based Stochastic Control with Markovian Rewards (Abstract)

Sudipto Guha

Kamesh Munagala

pp. 483-493

PDF

Beating Simplex for Fractional Packing and Covering Linear Programs (Abstract)

Christos Koufogiannakis

Neal E. Young

pp. 494-504

PDF

Session 11

A Primal-Dual Randomized Algorithm for Weighted Paging (Abstract)

pp. 507-517

PDF

Finding Disjoint Paths in Expanders Deterministically and Online (Abstract)

Noga Alon

Michael Capalbo

pp. 518-524

PDF

Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions (Abstract)

Esther Ezra

Micha Sharir

pp. 525-535

PDF

Inferring Local Homology from Sampled Stratified Spaces (Abstract)

pp. 536-546

PDF

Session 12

Testing for Concise Representations (Abstract)

pp. 549-558

PDF

Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem (Abstract)

pp. 559-569

PDF

Testing Expansion in Bounded-Degree Graphs (Abstract)

Artur Czumaj

Christian Sohler

pp. 570-578

PDF

Approximate Hypergraph Partitioning and Applications (Abstract)

pp. 579-589

PDF

Sparse Random Linear Codes are Locally Decodable and Testable (Abstract)

Tali Kaufman

Madhu Sudan

pp. 590-600

PDF

Session 13

Minimizing Average Flow-time : Upper and Lower Bounds (Abstract)

Naveen Garg

Amit Kumar

pp. 603-613

PDF

Non-Preemptive Min-Sum Scheduling with Resource Augmentation (Abstract)

pp. 614-624

PDF

On the Advantage over Random for Maximum Acyclic Subgraph (Abstract)

Moses Charikar

Konstantin Makarychev

Yury Makarychev

pp. 625-633

PDF

Buy-at-Bulk Network Design with Protection (Abstract)

Spyridon Antonakopoulos

pp. 634-644

PDF

Session 14

Space-Efficient Identity Based EncryptionWithout Pairings (Abstract)

pp. 647-657

PDF

Round Complexity of Authenticated Broadcast with a Dishonest Majority (Abstract)

pp. 658-668

PDF

Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments (Abstract)

pp. 669-679

PDF

Mohammad Mahmoody-Ghidary

Lower Bounds on Signatures From Symmetric Primitives (Abstract)

Boaz Barak

pp. 680-688

PDF

Session 15

Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations (Abstract)

Eden Chlamtac

pp. 691-701

PDF

Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy (Abstract)

Konstantinos Georgiou

pp. 702-712

PDF

Local Global Tradeoffs in Metric Embeddings (Abstract)

Moses Charikar

Konstantin Makarychev

Yury Makarychev

pp. 713-723

PDF

The Computational Hardness of Estimating Edit Distance [Extended Abstract] (Abstract)

Alexandr Andoni

Robert Krauthgamer

pp. 724-734

PDF

Author Index

Author Index (PDF)

pp. 735-736