The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (2003)
Cambridge, Massachusettes
Oct. 11, 2003 to Oct. 14, 2003
ISSN: 0272-5428
ISBN: 0-7695-2040-5
TABLE OF CONTENTS
Introduction

Foreword (PDF)

pp. x

Reviewers (PDF)

pp. xii
Tutorial 1

null (PDF)

pp. null
Tutorial 2

null (PDF)

pp. null

Mixing (Abstract)

Dana Randall , Georgia Institute of Technology
pp. 4
Tutorial 3

null (PDF)

pp. null
Session 1:

null (PDF)

pp. null

A Polynomial Algorithm for Recognizing Perfect Graphs (Abstract)

Xinming Liu , Carnegie Mellon University
Gérard Cornuéjols , Université de Marseille
Kristina Vušković , University of Leeds
pp. 20

Paths, Trees, and Minimum Latency Tours (Abstract)

Satish Rao , University of California at Berkeley
Brighten Godfrey , University of California at Berkeley
Kamalika Chaudhuri , University of California at Berkeley
Kunal Talwar , University of California at Berkeley
pp. 36

Approximation Algorithms for Orienteering and Discounted-Reward TSP (Abstract)

David R. Karger , Massachusetts Institute of Technology
Avrim Blum , Carnegie Mellon University
Maria Minkoff , University of New Mexico
Shuchi Chawla , Carnegie Mellon University
Terran Lane , University of New Mexico
Adam Meyerson , Carnegie Mellon University
pp. 46

Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs (Abstract)

Maxim Sviridenko , IBM T.J. Watson Research Center
Nira Shafrir , Tel-Aviv University
Haim Kaplan , Tel-Aviv University
Moshe Lewenstein , Bar-Ilan University
pp. 56
Session 2:

null (PDF)

pp. null

On the Implementation of Huge Random Objects (Abstract)

Asaf Nussboim , Weizmann Institute of Science
Shafi Goldwasser , Weizmann Institute of Science and Massachusetts Institute of Technology
Oded Goldreich , Weizmann Institute of Science
pp. 68

Zero-Knowledge Sets (Abstract)

Michael Rabin , Harvard University
Silvio Micali , Massachusetts Institute Technology
Joe Kilian , NEC Laboratories
pp. 80

On the (In)security of the Fiat-Shamir Paradigm (Abstract)

Shafi Goldwasser , The Weizmann Institute of Science at Rehovot
Yael Tauman Kalai , The Weizmann Institute of Science at Rehovot
pp. 102
Session 3:

null (PDF)

pp. null

Locally Testable Cyclic Codes (Abstract)

Lászl Babai , University of Chicago
Amir Shpilka , Harvard University
Daniel Štefanković , University of Chicago
pp. 116

List-Decoding Using The XOR Lemma (Abstract)

Luca Trevisan , University of California at Berkeley
pp. 126

On ε-Biased Generators in NC<sup>0</sup> (Abstract)

Luca Trevisan , University of California at Berkeley
Amir Shpilka , Harvard University
Elchanan Mossel , University of California at Berkeley
pp. 136

Proving Hard-Core Predicates Using List Decoding (Abstract)

Adi Akavia , Weizmann Institute
Samuel Safra , Tel Aviv University
Shafi Goldwasser , Weizmann Institute and Massachusetts Institute of Technology
pp. 146
Session 4:

null (PDF)

pp. null

Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model (Abstract)

Ashish Goel , Stanford University
Rajat Bhattacharjee , University of Southern California
pp. 160

Always Good Turing: Asymptotically Optimal Probability Estimation (Abstract)

Alon Orlitsky , University of California at San Diego
Narayana P. Santhanam , University of California at San Diego
Junan Zhang , University of California at San Diego
pp. 179

Learning DNF from Random Walks (Abstract)

Rocco A. Servedio , Columbia University
Elchanan Mossel , University of California at Berkeley
Ryan O?Donnell , Institute for Advanced Study
Nader Bshouty , Technion
pp. 189
Session 5:

null (PDF)

pp. null

Quantum Search of Spatial Regions (Abstract)

Andris Ambainis , University of Latvia
Scott Aaronson , University of California at Berkeley
pp. 200

A Lattice Problem in Quantum NP (Abstract)

Dorit Aharonov , The Hebrew University
Oded Regev , Institute for Advanced Study
pp. 210

A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness (Abstract)

Rahul Jain , Tata Institute of Fundamental Research and CWI
Pranab Sen , University of Waterloo
Jaikumar Radhakrishnan , Tata Institute of Fundamental Research
pp. 220
Session 6:

null (PDF)

pp. null

An In-Place Sorting with O(n log n) Comparisons and O(n) Moves (Abstract)

Viliam Geffert , P. J. Šafárik University
Gianni Franceschini , University of Pisa
pp. 242

Breaking a Time-and-Space Barrier in Constructing Full-Text Indices (Abstract)

Wing-Kai Hon , University of Hong Kong
Kunihiko Sadakane , Kyushu University
Wing-Kin Sung , National University of Singapore
pp. 251

The Cost of Cache-Oblivious Searching (Abstract)

Simai He , State University of New York at Stony Brook
Haodong Hu , State University of New York at Stony Brook
Dongdong Ge , State University of New York at Stony Brook
Gerth St?lting Brodal , University of Aarhus and Carlsberg Foundation
John Iacono , Polytechnic University, Brooklyn
Rolf Fagerberg , University of Aarhus
Michael A. Bender , State University of New York at Stony Brook and Sandia National Laboratories
Alejandro López-Ortiz , University of Waterloo
pp. 271

Tight Lower Bounds for the Distinct Elements Problem (Abstract)

Piotr Indyk , Massachusetts Institute of Technology
David Woodruff , Massachusetts Institute of Technology
pp. 283
Session 7:

null (PDF)

pp. null

More on Average Case vs Approximation Complexity (Abstract)

Michael Alekhnovich , Massachusetts Institute of Technology
pp. 298

On Worst-Case to Average-Case Reductions for NP Problems (Abstract)

Luca Trevisan , University of California at Berkeley
Andrej Bogdanov , University of California at Berkeley
pp. 308

Rank Bounds and Integrality Gaps for Cutting Planes Procedures (Abstract)

Joshua Buresh-Oppenheim , University of Toronto
Nicola Galesi , Universitat Politecnica de Catalunya
Shlomo Hoory , University of Toronto
Avner Magen , University of Toronto
Toniann Pitassi , University of Toronto
pp. 318
Session 8:

null (PDF)

pp. null

Algorithms and Complexity Results for #SAT and Bayesian Inference (Abstract)

Toniann Pitassi , University of Toronto
Fahiem Bacchus , University of Toronto
Shannon Dalmao , University of Toronto
pp. 340

Linear Upper Bounds for Random Walk on Small Density Random 3-CNF (Abstract)

Mikhail Alekhnovich , Massachusetts Institute of Technology
Eli Ben-Sasson , Harvard University and Massachusetts Institute of Technology
pp. 352

On the Maximum Satisfiability of Random Formulas (Abstract)

Yuval Peres , University of California at Berkeley
Assaf Naor , Microsoft Research
Dimitris Achlioptas , Microsoft Research
pp. 362
Session 9:

null (PDF)

pp. null

Logics for Reasoning about Cryptographic Constructions (Abstract)

Bruce M. Kapron , University of Victoria
Russell Impagliazzo , University of California at San Diego
pp. 372

Lower Bounds for Non-Black-Box Zero Knowledge (Abstract)

Salil Vadhan , Harvard University
Boaz Barak , Weizmann Institute of Science
Yehuda Lindell , IBM T.J. Watson Research
pp. 384

Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds (Abstract)

Rafael Pass , Royal Institute of Technology
Alon Rosen , Massachusetts Institute of Technology
pp. 404
Session 10:

null (PDF)

pp. null

Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time 0(m<sup>1.31</sup>) (Abstract)

Daniel A. Spielman , Massachusetts Institute of Technology
Shang-Hua Teng , Boston University and Akamai Technologies Inc.
pp. 416

Separating the Power of Monotone Span Programs over Different Fields (Abstract)

Amos Beimel , Ben-Gurion University
Enav Weinreb , Ben-Gurion University
pp. 428

A Group-Theoretic Approach to Fast Matrix Multiplication (Abstract)

Henry Cohn , Microsoft Research
Christopher Umans , California Institute of Technology
pp. 438

Symmetric Polynomials over \mathbb{Z}_m and Simultaneous Communication Protocols (Abstract)

Richard J. Lipton , Georgia Institute of Technology
Parikshit Gopalan , Georgia Institute of Technology
Nayantara Bhatnagar , Georgia Institute of Technology
pp. 450
Session 11:

null (PDF)

pp. null

Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm (Abstract)

Alberto Marchetti-Spaccamela , Università di Roma "La Sapienza"
Luca Becchetti , Università di Roma "La Sapienza"
Stefano Leonardi , Università di Roma "La Sapienza"
Tjark Vredeveld , Konrad-Zuse-Zentrum für Informationstechnik
Guido Schäfer , Max-Planck-Institut für Informatik
pp. 462

Stability and Efficiency of a Random Local Load Balancing Protocol (Abstract)

Aris Anagnostopoulos , Brown University
Adam Kirsch , Brown University
Eli Upfal , Brown University
pp. 472

Gossip-Based Computation of Aggregate Information (Abstract)

Alin Dobra , Cornell University
Johannes Gehrke , Cornell University
David Kempe , Cornell University
pp. 482

Broadcasting Algorithms in Radio Networks with Unknown Topology (Abstract)

Wojciech Rytter , New Jersey Institute of Technology and Warsaw University
Artur Czumaj , New Jersey Institute of Technology
pp. 492

Switch Scheduling via Randomized Edge Coloring (Abstract)

Rajeev Motwani , Stanford University
Devavrat Shah , Stanford University
Gagan Aggarwal , Stanford University
An Zhu , Stanford University
pp. 502
Session 12:

null (PDF)

pp. null

On the Impossibility of Dimension Reduction in \ell _1 (Abstract)

Moses Charikar , Princeton University
Bo Brinkman , Princeton University
pp. 514

Clustering with Qualitative Information (Abstract)

Venkatesan Guruswami , University of Washington
Anthony Wirth , Princeton University
Moses Charikar , Princeton University
pp. 524

Bounded Geometries, Fractals, and Low-Distortion Embeddings (Abstract)

Robert Krauthgamer , University of California at Berkeley
Anupam Gupta , Carnegie Mellon University
James R. Lee , University of California at Berkeley
pp. 534
Session 13:

null (PDF)

pp. null
Session 14:

null (PDF)

pp. null

Towards a Characterization of Truthful Combinatorial Auctions (Abstract)

Ron Lavi , Hebrew University of Jerusalem
Ahuva Mu'alem , Hebrew University of Jerusalem
Noam Nisan , Hebrew University of Jerusalem
pp. 574

Group Strategyproof Mechanisms via Primal-Dual Algorithms (Abstract)

Éva Tardo , Cornell University
Martin Pál , Cornell University
pp. 584

The Value of Knowing a Demand Curve: Bounds on Regret for Online Posted-Price Auctions (Abstract)

Robert Kleinberg , Massachusetts Institute of Technology
Tom Leighton , Massachusetts Institute of Technology
pp. 594

Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem (Abstract)

Anupam Gupta , Carnegie Mellon University
Martin Pál , Cornell University
Amit Kumar , Lucent Bell Labs
Tim Roughgarden , Cornell University
pp. 606
Session 15:

null (PDF)

pp. null

A Non-Markovian Coupling for Randomly Sampling Colorings (Abstract)

Eric Vigoda , University of Chicago
Thomas P. Hayes , University of Chicago
pp. 618

The Ising Model on Trees: Boundary Conditions and Mixing Time (Abstract)

Alistair Sinclair , University of California at Berkeley
Fabio Martinelli , University of Roma Tre
Dror Weitz , University of California at Berkeley
pp. 628

Logconcave Functions: Geometry and Efficient Sampling Algorithms (Abstract)

Santosh Vempala , Massachusetts Institute of Technology
László Lovász , Microsoft Research
pp. 640

Simulated Annealing in Convex Bodies and an 0*(n<sup>4</sup>) Volume Algorithm (Abstract)

László Lovász , Microsoft Research
Santosh Vempala , Massachusetts Institute of Technology
pp. 650
Author Index

Author Index (PDF)

pp. 660
88 ms
(Ver 3.1 (10032016))