The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1999)
New York, New York
Oct. 17, 1999 to Oct. 18, 1999
ISSN: 0272-5428
ISBN: 0-7695-0409-4
TABLE OF CONTENTS

Foreword (PDF)

pp. xii

Reviewers (PDF)

pp. xiv
Session 1, Chair: David Schmoys

Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems (Abstract)

Vijay V. Vazirani , Georgia Institute of Technology
Kamal Jain , Georgia Institute of Technology
pp. 2
Session 2, Chair: Paul Beame

Improved Bounds for Sampling Coloring (Abstract)

Eric Vigoda , University of California at Berkeley
pp. 51

Derandomizing Arthur-Merlin Games Using Hitting Sets (Abstract)

N.V. Vinodchandran , University of Aarhus
Peter Bro Miltersen , University of Aarhus
pp. 71
Session 3, Chair: Joseph Mitchell

Taking a Walk in a Planar Arrangement (Abstract)

Sariel Har-Peled , Tel Aviv University
pp. 100
Session 4, Chair: Michael Mitsenmacher

Verifiable Random Functions (Abstract)

Michael Rabin , Harvard University
Salil Vadhan , Massachusetts Institute of Technology
Silvio Micali , Massachusetts Institute of Technology
pp. 120

How Asymmetry Helps Load Balancing (Abstract)

Berthold Vöcking , International Computer Science Institute
pp. 131

Noncryptographic Selection Protocols (Abstract)

Uriel Feige , Weizmann Institute
pp. 142
Session 5A, Chair: Andrei Broder
Session 5B, Chair: Eric Allender

Near-Optimal Conversion of Hardness into Pseudo-Randomness (Abstract)

Ronen Shaltiel , Hebrew University
Avi Wigderson , Hebrew University
Russell Impagliazzo , University of California at San Diego
pp. 181

Error Reduction for Extractors (Abstract)

Ran Raz , Weizmann Institute
Omer Reingold , Weizmann Institute
Salil Vadhan , Massachusetts Institute of Technology
Ran Raz , Weizmann Institute
pp. 191

Primality and Identity Testing via Chinese Remaindering (Abstract)

Manindra Agrawal , Indian Institute of Technology
Somenath Biswas , Indian Institute of Technology
pp. 202
Session 6A, Chair: Dana Randall

On Counting Independent Sets in Sparse Graphs (Abstract)

Alan Frieze , Carnegie Mellon University
Mark Jerrum , University of Edinburgh
Martin Dyer , University of Leeds
pp. 210

Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics (Abstract)

Jeong Han Kim , Microsoft Research
Christian Borgs , Microsoft Research
Eric Vigoda , University of California at Berkeley
Van Ha Vu , Institute for Advanced Study
Prasad Tetali , Georgia Institute of Technology
Jennifer T. Chayex , Microsoft Research
Alan Frieze , Carnegie Mellon University
pp. 218

Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions (Abstract)

Alistair Sinclair , University of California at Berkeley
Ben Morris , University of California at Berkeley
pp. 230

Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain (Abstract)

V.S. Anil Kumar , Indian Institute of Science
H. Ramesh , Indian Institute of Science
pp. 241
Session 6B, Chair: James Aspnes

A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction (Abstract)

Vitaly Rubinovich , Bar Ilan University
David Peleg , The Weizmann Institute of Science
pp. 253

Long-Lived Adaptive Collect with Applications (Abstract)

Dan Touitou , Interdisciplinary Center
Yehuda Afek , Tel-Aviv University
Gideon Stupp , Tel-Aviv University
pp. 262

Cache-Oblivious Algorithms (Abstract)

Harald Prokop , Massachusetts Institute of Technology
Charles E. Leiserson , Massachusetts Institute of Technology
Matteo Frigo , Massachusetts Institute of Technology
Sridhar Ramachandran , Massachusetts Institute of Technology
pp. 285
Session 7A, Chair: Satish Rao

The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals (Abstract)

Matthias Ruhl , Massachusetts Institute of Technology
Jon Feldman , Massachusetts Institute of Technology
pp. 299

Setting Parameters by Example (Abstract)

David Eppstein , University of California at Irvine
pp. 309

Finding Double Euler Trails of Planar Graphs in Linear Time (Abstract)

Chun-Hsi Huang , State University of New York at Buffalo
Xin He , State University of New York at Buffalo
Zhi-Zhong Chen , Tokyo Denki University
pp. 319
Session 7B, Chair: Peter Shor

Bounds for Small-Error and Zero-Error Quantum Algorithms (Abstract)

Richard Cleve , University of Calgary
Christof Zalka , Los Alamos National Laboratory
Ronald de Wolf , CWI and University of Amsterdam
pp. 358

Optimal Lower Bounds for Quantum Automata and Random Access Codes (Abstract)

Ashwin Nayak , University of California at Berkeley
pp. 369
Session 8A, Chair: Joseph Mitchell

Cuts, Trees and -Embeddings of Graphs (Abstract)

Alistair Sinclair , University of California at Berkeley
Anupam Gupta , University of California at Berkeley
Yuri Rabinovich , University of Haifa
Ilan Newman , University of Haifa
pp. 399
Session 8B, Chair: Paul Beame

Random CNF's are Hard for the Polynomial Calculus (Abstract)

Russell Impagliazzo , University of California at San Diego
Eli Ben-Sasson , Hebrew University
pp. 415

A Study of Proof Search Algorithms for Resolution and Polynomial Calculus (Abstract)

Nicola Galesi , Universitat Politecnica de Catalunya
Maria Luisa Bonet , Universitat Politecnica de Catalunya
pp. 422
Session 9A, Chair: Yair Bartal

Online Scheduling to Minimize Average Stretch (Abstract)

S. Muthukrishnan , AT&T Shannon Laboratories
Johannes E. Gehrke , University of Wisconsin at Madison
Rajmohan Rajaraman , Northeastern University
Anthony Shaheen , Loyola Marymount University
pp. 433

Weak Adversaries for the k-Server Problem (Abstract)

Elias Koutsoupias , University of California at Los Angeles
pp. 444

Finely-Competitive Paging (Abstract)

Carl Burch , Carnegie Mellon University
Avrim Blum , Carnegie Mellon University
Adam Kalai , Carnegie Mellon University
pp. 450
Session 9B, Chair: Luca Trevisan

On the Complexity of SAT (Abstract)

Richard J. Lipton , Princeton University
Anastasios Viglas , Princeton University
pp. 459

Hardness of Approximating Minimization Problems (Abstract)

Christopher Umans , University of California at Berkeley
pp. 465

Hardness of Approximating the Minimum Distance of a Linear Code (Abstract)

Daniele Micciancio , Massachusetts Institute of Technology
Madhu Sudan , Massachusetts Institute of Technology
Ilya Dumer , University of California at Riverside
pp. 475
Session 10A, Chair: Ming Li

On Universal and Fault-Tolerant Quantum Computing: A Novel Basis and a New Constructive Proof of Universality for Shor's Basis (Abstract)

P. Oscar Boykin , University of California at Los Angeles
Farrokh Vatan , University of California at Los Angeles
Vwani Roychowdhury , University of California at Los Angeles
Matthew Pulver , University of California at Los Angeles
Tal Mor , University of California at Los Angeles
pp. 486

An Approximate L1-Difference Algorithm for Massive Data Streams (Abstract)

M. Viswanathan , University of Pennsylvania
S. Kannan , AT&T Labs--Research
J. Feigenbaum , AT&T Labs--Research
M. Strauss , AT&T Labs--Research
pp. 501

Algorithmic Aspects of Protein Structure Similarity (Abstract)

Sorin Istrail , Sandia National Laboratories
Christos H. Papadimitriou , University of California at Berkeley
Deborah Goldman , University of California at Berkeley
pp. 512
Session 10B, Chair: Luca Trevisan

Magic Functions (Abstract)

Omer Reingold , Weizmann Institute of Science
Moni Naor , Weizmann Institute of Science
Cynthia Dwork , IBM Almaden Research Center
Larry Stockmeyer , IBM Almaden Research Center
pp. 523

Limits on the Efficiency of One-Way Permutation-Based Hash Functions (Abstract)

Jeong Han Kim , Microsoft Research
Daniel R. Simon , Microsoft Research
Prasad Tetali , Georgia Institute of Technology
pp. 535

Non-Interactive CryptoComputing For NC1 (Abstract)

Tomas Sander , International Computer Science Institute
Adam Young , Columbia University
Moti Yung , CertCo Incorporated
pp. 554
Session 11A, Chair: Susanne Albers

Fairness in Routing and Load Balancing (Abstract)

Jon Kleinberg , Cornell University
Eva Tardos , Cornell University
Yuval Rabani , Technion - Israel Institute of Technology
pp. 568

Stochastic Load Balancing and Related Problems (Abstract)

Ashish Goel , University of Southern California
Piotr Indyk , Stanford University
pp. 579

Finding Maximal Repetitions in a Word in Linear Time (Abstract)

Gregory Kucherov , LORIA/INRIA-Lorraine
Roman Kolpakov , Moscow University
pp. 596

All Pairs Shortest Paths in Undirected Graphs with Integer Weights (Abstract)

Uri Zwick , Tel Aviv University
Avi Shoshan , Tel Aviv University
pp. 605
Session 11B, Chair: Nader Bshouty

An Algorithmic Theory of Learning: Robust Concepts and Random Projection (Abstract)

Rosa I. Arriaga , Harvard University
Santosh Vempala , Massachusetts Institute of Technology
pp. 616

Boosting and Hard-Core Sets (Abstract)

Adam R. Klivans , Massachusetts Institute of Technology
Rocco A. Servedio , Harvard University
pp. 624

Learning Mixtures of Gaussians (Abstract)

Sanjoy Dasgupta , University of California at Berkeley
pp. 634

Regular Languages are Testable with a Constant Number of Queries (Abstract)

Michael Krivelevich , Rutgers University
Noga Alon , Tel Aviv University
Mario Szegedy , AT&T Labs-Research
Ilan Newman , University of Haifa
pp. 645

Efficient Testing of Large Graphs (Abstract)

Michael Krivelevich , Rutgers University
Noga Alon , Tel-Aviv University
Mario Szegedy , AT&T Labs-Research
Eldar Fischer , Tel-Aviv University
pp. 656

Author Index (PDF)

pp. 667
82 ms
(Ver 3.3 (11022016))