The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (2013)
Berkeley, CA USA
Oct. 26, 2013 to Oct. 29, 2013
ISSN: 0272-5428
TABLE OF CONTENTS

Cover Art (PDF)

pp. C4

Title Page i (PDF)

pp. i

Title Page iii (PDF)

pp. iii

Copyright Page (PDF)

pp. iv

Table of Contents (PDF)

pp. v-xi

Foreword (PDF)

pp. xii

Reviewers (PDF)

pp. xv-xxi

An Improved Competitive Algorithm for Reordering Buffer Management (Abstract)

Noa Avigdor-Elgrabli , Comput. Sci. Dept., Technion - Israel Inst. of Technol., Haifa, Israel
Yuval Rabani , Sch. of Comput. Sci. & Eng., Hebrew Univ. of Jerusalem, Jerusalem, Israel
pp. 1-10

On Randomized Memoryless Algorithms for the Weighted K-Server Problem (Abstract)

Ashish Chiplunkar , Dept. of Comput. Sci. & Eng., Indian Inst. of Technol. Bombay, Mumbai, India
Sundar Vishwanathan , Dept. of Comput. Sci. & Eng., Indian Inst. of Technol. Bombay, Mumbai, India
pp. 11-19

Approximating Bin Packing within O(log OPT * Log Log OPT) Bins (Abstract)

Thomas Rothvoss , Dept. of Math., MIT, Cambridge, MA, USA
pp. 20-29

Constant-Round Concurrent Zero Knowledge from P-Certificates (Abstract)

Kai-Min Chung , Acad. Sinica, Taipei, Taiwan
Huijia Lin , Univ. of California, Santa Barbara, Santa Barbara, CA, USA
Rafael Pass , Cornell Univ., Ithaca, NY, USA
pp. 50-59

Simultaneous Resettability from One-Way Functions (Abstract)

Kai-Min Chung , Acad. Sinica, Taipei, Taiwan
Rafail Ostrovsky , UCLA, Los Angeles, CA, USA
Rafael Pass , Cornell Univ., Ithaca, NY, USA
Ivan Visconti , Univ. of Salerno, Fisciano, Italy
pp. 60-69

From Unprovability to Environmentally Friendly Protocols (Abstract)

Ran Canetti , Boston Univ. & Tel Aviv Univ., Boston, MA, USA
Huijia Lin , Univ. of California, Santa Barbara, Santa Barbara, CA, USA
Rafael Pass , Cornell Univ., Ithaca, NY, USA
pp. 70-79

Simple Tabulation, Fast Expanders, Double Tabulation, and High Independence (Abstract)

Mikkel Thorup , Dept. of Comput. Sci., Univ. of Copenhagen, Copenhagen, Denmark
pp. 90-99

A Polynomial Time Algorithm for Lossy Population Recovery (Abstract)

Ankur Moitra , Dept. of Math., Massachusetts Inst. of Technol., Cambridge, MA, USA
Michael Saks , Dept. of Math., Rutgers Univ., New Brunswick, NJ, USA
pp. 110-116

OSNAP: Faster Numerical Linear Algebra Algorithms via Sparser Subspace Embeddings (Abstract)

Jelani Nelson , Sch. of Eng. & Appl. Sci., Harvard Univ., Cambridge, MA, USA
Huy L. Nguyen , Dept. of Comput. Sci., Princeton Univ., Princeton, NJ, USA
pp. 117-126

Iterative Row Sampling (Abstract)

Mu Li , Comput. Sci. Dept., CMU, Pittsburgh, PA, USA
Gary L. Miller , Comput. Sci. Dept., CMU, Pittsburgh, PA, USA
Richard Peng , Comput. Sci. Dept., CMU, Pittsburgh, PA, USA
pp. 127-136

Algebraic Algorithms for B-Matching, Shortest Undirected Paths, and F-Factors (Abstract)

Harold N. Gabow , Dept. of Comput. Sci., Univ. of Colorado at Boulder, Boulder, CO, USA
Piotr Sankowski , Inst. of Inf., Univ. of Warsaw, Warsaw, Poland
pp. 137-146

Efficient Accelerated Coordinate Descent Methods and Faster Algorithms for Solving Linear Systems (Abstract)

Yin Tat Lee , Math. Dept., Massachusetts Inst. of Technol., Cambridge, MA, USA
Aaron Sidford , Electr. Eng. & Comput. Sci. Dept., Massachusetts Inst. of Technol., Cambridge, MA, USA
pp. 147-156

Faster Canonical Forms for Strongly Regular Graphs (Abstract)

Laszlo Babai , Univ. of Chicago, Chicago, IL, USA
Xi Chen , Columbia Univ., New York, NY, USA
Xiaorui Sun , Columbia Univ., New York, NY, USA
Shang-Hua Teng , Univ. of Southern California, Los Angeles, CA, USA
John Wilmes , Univ. of Chicago, Chicago, IL, USA
pp. 157-166

Approximation Algorithms for Euler Genus and Related Problems (Abstract)

Chandra Chekuri , Dept. of Comput. Sci., Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA
Anastasios Sidiropoulos , Dept. of Comput. Sci. & Eng., Ohio State Univ., Columbus, OH, USA
pp. 167-176

Non-positive Curvature and the Planar Embedding Conjecture (Abstract)

Anastasios Sidiropoulos , Dept. of Comput. Sci. & Eng., Ohio State Univ., Columbus, OH, USA
pp. 177-186

Bandits with Knapsacks (Abstract)

Ashwinkumar Badanidiyuru , Comput. Sci. Dept., Cornell Univ., Ithaca, NY, USA
Robert Kleinberg , Comput. Sci. Dept., Cornell Univ., Ithaca, NY, USA
Aleksandrs Slivkins , Microsoft Res. Silicon Valley, Mountain View, CA, USA
pp. 207-216

Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas (Abstract)

Vitaly Feldman , IBM Res. - Almaden, San Jose, CA, USA
Jan Vondrak , IBM Res. - Almaden, San Jose, CA, USA
pp. 227-236

Estimating the Distance from Testable Affine-Invariant Properties (Abstract)

Hamed Hatami , Sch. of Comput. Sci., McGill Univ., Montreal, QC, Canada
Shachar Lovett , Comput. Sci. & Eng. Dept., Univ. of California, San Diego, La Jolla, CA, USA
pp. 237-242

Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs (Abstract)

Michael A. Forbes , Dept. of EECS, MIT CSAIL, Cambridge, MA, USA
Amir Shpilka , Fac. of Comput. Sci., Technion - Israel Inst. of Technol., Haifa, Israel
pp. 243-252

Nearly Maximum Flows in Nearly Linear Time (Abstract)

Jonah Sherman , Comput. Sci. Div., Univ. of California at Berkeley, Berkeley, CA, USA
pp. 263-269

Towards a Better Approximation for Sparsest Cut? (Abstract)

Sanjeev Arora , Comput. Sci. Dept., Princeton Univ., Princeton, NJ, USA
Rong Ge , Comput. Sci. Dept., Princeton Univ., Princeton, NJ, USA
Ali Kemal Sinop , Comput. Sci. Dept., Princeton Univ., Princeton, NJ, USA
pp. 270-279

Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring (Abstract)

Vida Dujmovic , Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, ON, Canada
Pat Morin , Sch. of Comput. Sci., Carleton Univ., Ottawa, ON, Canada
David R. Wood , Sch. of Math. Sci., Monash Univ., Melbourne, VIC, Australia
pp. 280-289

Element Distinctness, Frequency Moments, and Sliding Windows (Abstract)

Paul Beame , Comput. Sci. & Eng., Univ. of Washington, Seattle, WA, USA
Raphael Clifford , Dept. of Comput. Sci., Univ. of Bristol, Bristol, UK
Widad Machmouchi , Comput. Sci. & Eng., Univ. of Washington, Seattle, WA, USA
pp. 290-299

Spatial Mixing and Approximation Algorithms for Graphs with Bounded Connective Constant (Abstract)

Alistair Sinclair , Comput. Sci. Div., UC Berkeley, Berkeley, CA, USA
Piyush Srivastava , Comput. Sci. Div., UC Berkeley, Berkeley, CA, USA
Yitong Yin , State Key Lab. for Novel Software Technol., Nanjing Univ., Nanjing, China
pp. 300-309

Polar Codes: Speed of Polarization and Polynomial Gap to Capacity (Abstract)

Venkatesan Guruswami , Carnegie Mellon Univ., Pittsburgh, PA, USA
Patrick Xia , Carnegie Mellon Univ., Pittsburgh, PA, USA
pp. 310-319

Strong LTCs with Inverse Poly-Log Rate and Constant Soundness (Abstract)

Michael Viderman , Comput. Sci. Dept., Technion - Israel Inst. of Technol., Haifa, Israel
pp. 330-339

PCPs via Low-Degree Long Code and Hardness for Constrained Hypergraph Coloring (Abstract)

Irit Dinur , Dept. of Appl. Math & Comput. Sci., Weizmann Inst. of Sci., Rehovot, Israel
Venkatesan Guruswami , Comput. Sci. Dept., Carnegie Mellon Univ., Pittsburgh, PA, USA
pp. 340-349

Approximate Constraint Satisfaction Requires Large LP Relaxations (Abstract)

Siu On Chan , Microsoft Research New England, Cambridge, MA, USA
James R. Lee , Univ. of Washington, Seattle, WA, USA
Prasad Raghavendra , UC Berkeley, Berkeley, CA, USA
David Steurer , Cornell Univ., Ithaca, NY, USA
pp. 350-359

The Complexity of Approximating Vertex Expansion (Abstract)

Anand Louis , Coll. of Comput., Georgia Tech, Atlanta, GA, USA
Prasad Raghavendra , EECS, UC Berkeley, Berkeley, CA, USA
Santosh Vempala , Coll. of Comput., Georgia Tech, Atlanta, GA, USA
pp. 360-369

Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses (Abstract)

Parinya Chalermsook , Max-Planck-Inst. fur Inf., Saarbrücken, Germany
Bundit Laekhanukit , McGill Univ., Montréal, QC, Canada
Danupon Nanongkai , Nanyang Technol. Univ., Singapore, Singapore
pp. 370-379

Chasing the K-Colorability Threshold (Abstract)

Amin Coja-Oghlan , Math. Inst., Goethe Univ., Frankfurt, Germany
Dan Vilenchik , Facutly of Math. & Comput. Sci, Weizamnn Inst., Rehovot, Israel
pp. 380-389

Approximation Schemes for Maximum Weight Independent Set of Rectangles (Abstract)

Anna Adamaszek , Max-Planck-Inst. fur Inf., Saarbrücken, Germany
Andreas Wiese , Max-Planck-Inst. fur Inf., Saarbrücken, Germany
pp. 400-409

Klee's Measure Problem Made Easy (Abstract)

Timothy M. Chan , Cheriton Sch. of Comput. Sci., Univ. of Waterloo, Waterloo, ON, Canada
pp. 410-419

Playing Non-linear Games with Linear Oracles (Abstract)

Dan Garber , Technion - Israel Inst. of Technol., Haifa, Israel
Elad Hazan , Technion - Israel Inst. of Technol., Haifa, Israel
pp. 420-428

Local Privacy and Statistical Minimax Rates (Abstract)

John C. Duchi , Dept. of Electr. Eng. & Comput. Sci., Univ. of California, Berkeley, Berkeley, CA, USA
Michael I. Jordan , Dept. of Electr. Eng. & Comput. Sci., Univ. of California, Berkeley, Berkeley, CA, USA
Martin J. Wainwright , Dept. of Electr. Eng. & Comput. Sci., Univ. of California, Berkeley, Berkeley, CA, USA
pp. 429-438

Coupled-Worlds Privacy: Exploiting Adversarial Uncertainty in Statistical Data Privacy (Abstract)

Raef Bassily , Comput. Sci. & Eng. Dept., Pennsylvania State Univ., State College, PA, USA
Adam Groce , Dept. of Comput. Sci., Univ. of Maryland, College Park, MD, USA
Jonathan Katz , Dept. of Comput. Sci., Univ. of Maryland, College Park, MD, USA
Adam Smith , Comput. Sci. & Eng. Dept., Pennsylvania State Univ., State College, PA, USA
pp. 439-448

Knowledge-Preserving Interactive Coding (Abstract)

Kai-Min Chung , Acad. Sinica, Taipei, Taiwan
Rafael Pass , Cornell Univ., Ithaca, NY, USA
Sidharth Telang , Cornell Univ., Ithaca, NY, USA
pp. 449-458

Adaptive Seeding in Social Networks (Abstract)

Lior Seeman , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
Yaron Singer , Sch. of Eng. & Appl. Sci., Harvard Univ., Cambridge, MA, USA
pp. 459-468

The Moser-Tardos Framework with Partial Resampling (Abstract)

David G. Harris , Univ. of Maryland, College Park, MD, USA
Aravind Srinivasan , Univ. of Maryland, College Park, MD, USA
pp. 469-478

A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits (Abstract)

Russell Impagliazzo , Univ. of California, San Diego, La Jolla, CA, USA
Ramamohan Paturi , Univ. of California, San Diego, La Jolla, CA, USA
Stefan Schneider , Univ. of California, San Diego, La Jolla, CA, USA
pp. 479-488

Strong Backdoors to Bounded Treewidth SAT (Abstract)

Serge Gaspers , Univ. of New South Wales, Sydney, NSW, Australia
Stefan Szeider , Vienna Univ. of Technol., Vienna, Austria
pp. 489-498

An O(c^k n) 5-Approximation Algorithm for Treewidth (Abstract)

Hans L. Bodlaender , Dept. of Inf. & Comput. Sci., Utrecht Univ., Utrecht, Netherlands
Pal Gronas Drange , Dept. of Inf., Univ. of Bergen, Bergen, Norway
Markus S. Dregi , Dept. of Inf., Univ. of Bergen, Bergen, Norway
Fedor V. Fomin , Dept. of Inf., Univ. of Bergen, Bergen, Norway
Daniel Lokshtanov , Dept. of Inf., Univ. of Bergen, Bergen, Norway
Michal Pilipczuk , Dept. of Inf., Univ. of Bergen, Bergen, Norway
pp. 499-508

Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search (Abstract)

Marek Cygan , Inst. of Inf., Univ. of Warsaw, Warsaw, Poland
pp. 509-518

Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees (Abstract)

Adam Marcus , Yale Univ., New Haven, CT, USA
Daniel A. Spielman , Yale Univ., New Haven, CT, USA
Nikhil Srivastava , Microsoft Res., Bangalore, India
pp. 529-537

Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization (Abstract)

Monika Henzinger , Fac. of Comput. Sci., Univ. of Vienna, Vienna, Austria
Sebastian Krinninger , Fac. of Comput. Sci., Univ. of Vienna, Vienna, Austria
Danupon Nanongkai , Div. of Math. Sci., Nanyang Technol. Univ., Singapore, Singapore
pp. 538-547

Fully Dynamic (1+ e)-Approximate Matchings (Abstract)

Manoj Gupta , Dept. of CSE, I.I.T. Delhi, Delhi, India
Richard Peng , Comput. Sci. Dept., CMU, Pittsburgh, PA, USA
pp. 548-557

Online Node-Weighted Steiner Forest and Extensions via Disk Paintings (Abstract)

Mohammad Taghi Hajiaghayi , Comput. Sci. Dept., Univ. of Maryland, College Park, MD, USA
Vahid Liaghat , Comput. Sci. Dept., Univ. of Maryland, College Park, MD, USA
Debmalya Panigrahi , Comput. Sci. Dept., Duke Univ., Durham, NC, USA
pp. 558-567

An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree (Abstract)

Jochen Konemann , Combinatorics & Optimization, Univ. of Waterloo, Waterloo, ON, Canada
Sina Sadeghian , Combinatorics & Optimization, Univ. of Waterloo, Waterloo, ON, Canada
Laura Sanita , Combinatorics & Optimization, Univ. of Waterloo, Waterloo, ON, Canada
pp. 568-577

Arithmetic Circuits: A Chasm at Depth Three (Abstract)

Ankit Gupta , Microsoft Res. India, India
Pritish Kamath , Microsoft Res. India, India
Neeraj Kayal , Microsoft Res. India, India
Ramprasad Saptharishi , Chennai Math. Inst., Chennai, India
pp. 578-587

Improved Average-Case Lower Bounds for DeMorgan Formula Size (Abstract)

Ilan Komargodski , Weizmann Inst. of Sci., Rehovot, Israel
Ran Raz , Weizmann Inst. of Sci., Rehovot, Israel
Avishay Tal , Weizmann Inst. of Sci., Rehovot, Israel
pp. 588-597

Explicit Subspace Designs (Abstract)

Venkatesan Guruswami , Comput. Sci. Dept., Carnegie Mellon Univ., Pittsburgh, PA, USA
Swastik Kopparty , Dept. of Math., Rutgers Univ., Piscataway, NJ, USA
pp. 608-617

The Simple Economics of Approximately Optimal Auctions (Abstract)

Saeed Alaei , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
Hu Fu , New England Lab., Microsoft Res., Cambridge, MA, USA
Nima Haghpanah , EECS Dept., Northwestern Univ., Evanston, IL, USA
Jason Hartline , EECS Dept., Northwestern Univ., Evanston, IL, USA
pp. 628-637

The Price of Stability for Undirected Broadcast Network Design with Fair Cost Allocation Is Constant (Abstract)

Vittorio Bilo , Dept. of Math. & Phys. “Ennio De Giorgi”, Univ. of Salento, Lecce, Italy
Michele Flammini , Dept. of Comput. Sci., Univ. of L'Aquila, L'Aquila, Italy
Luca Moscardelli , Dept. of Econ. Studies, Univ. of Chieti-Pescara, Chieti-Pescara, Italy
pp. 638-647

Common Information and Unique Disjointness (Abstract)

Gabor Braun , Inst. fur Inf., Univ. Leipzig, Leipzig, Germany
Sebastian Pokutta , ISyE, Georgia Inst. of Technol., Atlanta, GA, USA
pp. 688-697

Approximating Minimization Diagrams and Generalized Proximity Search (Abstract)

Sariel Har-Peled , Dept. of Comput. Sci., Univ. of Illinois, Urbana, IL, USA
Nirman Kumar , Dept. of Comput. Sci., Univ. of Illinois, Urbana, IL, USA
pp. 717-726

The Parity of Directed Hamiltonian Cycles (Abstract)

Andreas Bjorklund , Dept. of Comput. Sci., Lund Univ., Lund, Sweden
Thore Husfeldt , Dept. of Comput. Sci., Lund Univ., Lund, Sweden
pp. 727-735

Nondeterministic Direct Product Reductions and the Success Probability of SAT Solvers (Abstract)

Andrew Drucker , Sch. of Math., Inst. for Adv. Study, Princeton, NJ, USA
pp. 736-745

Direct Products in Communication Complexity (Abstract)

Mark Braverman , Dept. of Comput. Sci., Princeton Univ., Princeton, NJ, USA
Anup Rao , Comput. Sci. & Eng., Univ. of Washington, Seattle, WA, USA
Omri Weinstein , Dept. of Comput. Sci., Princeton Univ., Princeton, NJ, USA
Amir Yehudayoff , Dept. of Math., Technion - Israel Inst. of Technol., Haifa, Israel
pp. 746-755

Three-Player Entangled XOR Games Are NP-Hard to Approximate (Abstract)

Thomas Vidick , Comput. Sci. & Artificial Intell. Lab., Massachusetts Inst. of Technol., Cambridge, MA, USA
pp. 766-775

Author Index (PDF)

pp. 776-778
89 ms
(Ver )