The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (2002)
Vancouver, BC, Canada
Nov. 16, 2002 to Nov. 19, 2002
ISSN: 0272-5428
ISBN: 0-7695-1822-2
TABLE OF CONTENTS
Introduction

Foreward (PDF)

pp. xiii

Reviewers (PDF)

pp. xv
TUTORIAL 1

Zero-Knowledge (PDF)

Oded Goldreich , Weizmann Institute of Science
pp. 3
TUTORIAL 2
TUTORIAL 3
SESSION 1A

Locally Testable Codes and PCPs of Almost-Linear Length (Abstract)

Oded Goldreich , Weizmann Institute of Science
Madhu Sudan , Massachusetts Institute of Technology
pp. 13

The Hardness of 3 -Uniform Hypergraph Coloring (Abstract)

Oded Regev , Institute for Advanced Study
Irit Dinur , Institute for Advanced Study
Clifford Smyth , Institute for Advanced Study
pp. 33
SESSION 1B

Minimizing Congestion in General Networks (Abstract)

Harald Räcke , Paderborn University
pp. 43

Small Induced-Universal Graphs and Compact Implicit Graph Representations (Abstract)

Theis Rauhe , IT University of Copenhagen
Stephen Alstrup , IT University of Copenhagen
pp. 53

Deterministic Broadcasting Time in Radio Networks of Unknown Topology (Abstract)

Andrzej Pelc , Université du Québec á Hull
Dariusz R. Kowalski , Uniwersytet Warszawski
pp. 63

Explicit Unique-Neighbor Expanders (Abstract)

Michael Capalbo , Institute for Advanced Study
Noga Alon , Institute for Advanced Study and Tel Aviv University
pp. 73
SESSION 2A

Abstract Combinatorial Programs and Efficient Property Testers (Abstract)

Artur Czumaj , New Jersey Institute of Technology
Christian Sohler , University of Paderborn
pp. 83

A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs (Abstract)

Kenji Obata , University of California at Berkeley
Andrej Bogdanov , University of California at Berkeley
Luca Trevisan , University of California at Berkeley
pp. 93

Testing Juntas (Abstract)

Alex Samorodnitsky , Hebrew University of Jerusalem
Shmuel Safra , Tel-Aviv University
Eldar Fischer , The Technion
Dana Ron , Tel-Aviv University
Guy Kindler , Tel-Aviv University
pp. 103

A Spectral Algorithm for Learning Mixtures of Distributions (Abstract)

Santosh Vempala , Massachusetts Institute of Technology
Grant Wang , Massachusetts Institute of Technology
pp. 113
SESSION 2B

Equivalence between Priority Queues and Sorting (Abstract)

Mikkel Thorup , AT&T Labs-Research, Shannon Laboratory
pp. 125

Integer Sorting in 0(n\sqrt {\log \log n}) Expected Time and Linear Space (Abstract)

Mikkel Thorup , AT&T Labs - Research Shannon Laboratory
Yijie Han , University of Missouri at Kansas City
pp. 135

Implicit B-Trees: New Results for the Dictionary Problem (Abstract)

Roberto Grossi , Università di Pisa
J. Ian Munro , University of Waterloo
Gianni Franceschini , Università di Pisa
Linda Pagli , Università di Pisa
pp. 145
SESSION 3A

Learning Intersections and Thresholds of Halfspaces (Abstract)

Rocco A. Servedio , Harvard University
Adam R. Klivans , Massachusetts Institute of Technology
Ryan O?Donnell , Massachusetts Institute of Technology
pp. 177

Learning a Hidden Matching (Abstract)

Simon Kasif , Boston University
Steven Rudich , Carnegie-Mellon University
Richard Beigel , Temple University
Benny Sudakov , Princeton University and Institute for Advanced Study
Noga Alon , Institute for Advanced Study and Tel Aviv University
pp. 197
SESSION 3B

An Information Statistics Approach to Data Stream and Communication Complexity (Abstract)

Ravi Kumar , IBM Almaden Research Center
T. S. Jayram , IBM Almaden Research Center
Ziv Bar-Yossef , IBM Almaden Research Center
D. Sivakumar , IBM Almaden Research Center
pp. 209

Static Optimality Theorem for External Memory String Access (Abstract)

Fabrizio Luccio , University of Pisa
S. Muthukrishnan , AT&T Labs - Research
Valentina Ciriani , University of Pisa
Paolo Ferragina , University of Pisa
pp. 219

A Simple Algorithmic Characterization of Uniform Solvability (Abstract)

Eli Gafni , University of California at Los Angeles
pp. 228

Correlation Clustering (Abstract)

Nikhil Bansal , Carnegie Mellon University
Avrim Blum , Carnegie Mellon University
Shuchi Chawla , Carnegie Mellon University
pp. 238
SESSION 4A

Decoding Turbo-Like Codes via Linear Programming (Abstract)

Jon Feldman , Massachusetts Institute of Technology
David R. Karger , Massachusetts Institute of Technology
pp. 251

LT Codes (Abstract)

Michael Luby , Digital Fountain, Inc.
pp. 271
SESSION 4B

Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers (Abstract)

Gideon Schechtman , Weizmann Institute of Science
Uriel Feige , Weizmann Institute of Science
Michael Langberg , Weizmann Institute of Science
pp. 283

On-Line End-to-End Congestion Control (Abstract)

Naveen Garg , Indian Institute of Technology at New Delhi
Neal E. Young , Akamai Technologies
pp. 303
SESSION 1A

Proving Integrality Gaps without Knowing the Linear Program (Abstract)

László Lovász , Microsoft Research
Béla Bollobás , University of Memphis
Sanjeev Arora , Princeton University
pp. 313

Dependent Rounding in Bipartite Graphs (Abstract)

Srinivasan Parthasarathy , University of Maryland at College Park
Samir Khuller , University of Maryland at College Park
Aravind Srinivasan , University of Maryland at College Park
Rajiv Gandhi , University of Maryland at College Park
pp. 323
SESSION 1B

Concurrent Zero Knowledge with Logarithmic Round-Complexity (Abstract)

Manoj Prabhakaran , Princeton University
Alon Rosen , Weizmann Institute of Science
Amit Sahai , Princeton University
pp. 366

On the (non)Universality of the One-Time Pad (Abstract)

Yevgeniy Dodis , New York University
Joel Spencer , New York University
pp. 376
SESSION 2A

Market Equilibrium via a Primal-Dual-Type Algorithm (Abstract)

Nikhil R. Devanur , University of California at Berkeley and ICSI Berkeley
Amin Saberi , University of California at Berkeley and ICSI Berkeley
Vijay V. Vazirani , University of California at Berkeley and ICSI Berkeley
Christos H. Papadimitriou , University of California at Berkeley
pp. 389

On the Hardness of Optimal Auctions (Abstract)

Amin Saberi , University of California at Berkeley and ICSI Berkeley
Amir Ronen , Stanford University and ICSI Berkeley
pp. 396

Auctions with Severely Bounded Communication (Abstract)

Liad Blumrosen , Hebrew University of Jerusalem
Noam Nisan , Hebrew University of Jerusalem
pp. 406
SESSION 2B

Privacy and Interaction in Quantum Communication Complexity and a Theorem about the Relative Entropy of Quantum States (Abstract)

Pranab Sen , Université de Paris-Sud
Rahul Jain , STCS, Tata Institute of Fundamental Research
Jaikumar Radhakrishnan , STCS, Tata Institute of Fundamental Research
pp. 429

Authentication of Quantum Messages (Abstract)

Daniel Gottesman , University of California at Berkeley
Adam Smith , Massachusetts Institute of Technology
Howard Barnum , Los Alamos National Laboratories
Claude Crépeau , McGill University
Alain Tapp , Université de Montréal
pp. 449
SESSION 3A

Packing 2-Dimensional Bins in Harmony (Abstract)

Alberto Caprara , University of Bologna
pp. 490

Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems (Abstract)

Naveen Garg , Indian Institute of Technology at New Delhi
Rohit Khandekar , Indian Institute of Technology at New Delhi
pp. 500
SESSION 3B

Quantum Computation and Lattice Problems (Abstract)

Oded Regev , Institute for Advanced Study
pp. 520

On the Decidability of Self-Assembly of Infinite Ribbons (Abstract)

Leonard Adleman , University of Southern California
Jarkko Kari , University of Iowa
Lila Kari , University of Western Ontario
Dustin Reishus , University of Southern California
pp. 530

The Parameterized Complexity of Counting Problems (Abstract)

Jörg Flum , Albert-Ludwigs-Universität Freiburg
Martin Grohe , University of Edinburgh
pp. 538
SESSION 4A

Dimension Reduction in the \ell _1 Norm (Abstract)

Moses Charikar , Princeton University
Amit Sahai , Princeton University
pp. 551

On Approximating the Radii of Point Sets in High Dimensions (Abstract)

Kasturi R. Varadarajan , University of Iowa
S. Venkatesh , Rutgers University
Jiawei Zhang , Stanford University
pp. 561
SESSION 4B

Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles (Abstract)

Paul Beame , University of Washington
Josh Buresh-Oppenheim , University of Toronto
Ran Raz , Weizmann Institute of Science
Toniann Pitassi , University of Toronto
Ashish Sabharwal , University of Washington
pp. 583

Satisfiability, Branch-Width and Tseitin Tautologies (Abstract)

Alexander A. Razborov , Institute for Advanced Study
Michael Alekhnovich , Massachusetts Institute of Technology
pp. 593
SESSION 1A

Dynamic Planar Convex Hull (Abstract)

Gerth Stølting Brodal , University of Aarhus
Riko Jacob , University of Aarhus
pp. 617

Optimal System of Loops on an Orientable Surface (Abstract)

Éric Colin de Verdière , Laboratoire d?informatique de l??cole Normale Sup?rieure
Francis Lazarus , Laboratoire IRCOM-SIC
pp. 627

The Partition Technique for Overlays of Envelopes (Abstract)

Vladlen Koltun , Tel Aviv University
Micha Sharir , Tel Aviv University
pp. 637
SESSION 1B

Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps (Abstract)

Peter Bürgisser , University of Paderborn
Martin Lotz , University of Paderborn
pp. 659

Power from Random Strings (Abstract)

Detlef Ronneburger , Rutgers University
Harry Buhrman , CWI and University of Amsterdam
Michal Koucký , Rutgers University
Dieter van Melkebeek , University of Wisconsin
Eric Allender , Rutgers University
pp. 669

Improved Dynamic Reachability Algorithms for Directed Graphs (Abstract)

Uri Zwick , Tel Aviv University
Liam Roditty , Tel Aviv University
pp. 679
SESSION 2A

Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks (Abstract)

Guy Even , Tel-Aviv University
Dana Ron , Tel-Aviv University
Zvi Lotker , Tel-Aviv University
Shakhar Smorodinsky , Tel-Aviv University
pp. 691

Global Information from Local Observation (Abstract)

Itai Benjamini , Microsoft Research
László Lov´sz , Microsoft Research
pp. 701

Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows (Abstract)

Leslie Ann Goldberg , University of Warwick
Russell Martin , University of Warwick
Mary Cryan , University of Leeds
Martin Dyer , University of Leeds
Mark Jerrum , University of Edinburgh
pp. 711

Spectral Gap and log-Sobolev Constant for Balanced Matroids (Abstract)

Jung-Bae Son , University of Edinburgh
Mark Jerrum , University of Edinburgh
pp. 721
SESSION 2B

Graph Isomorphism is in SPP (Abstract)

Piyush P Kurur , Institute of Mathematical Sciences
V. Arvind , Institute of Mathematical Sciences
pp. 743

Forbidden Information (Abstract)

Leonid A. Levin , Institut Des Hautes Etudes Scientifiques and Boston University
pp. 761
SESSION 3

The 3-XORSAT Threshold (Abstract)

Jacques Mandler , Université Pierre et Marie Curie
Olivier Dubois , Université Pierre et Marie Curie
pp. 769

The Asymptotic Order of the Random k -SAT Threshold (Abstract)

Dimitris Achlioptas , Microsoft Research
Cristopher Moore , University of New Mexico and Santa Fe Institute
pp. 779

On Random Symmetric Travelling Salesman Problems (Abstract)

Alan Frieze , Carnegie Mellon University
pp. 789

Load Balancing with Memory (Abstract)

Balaji Prabhakar , Stanford University
Devavrat Shah , Stanford University
Michael Mitzenmacher , Harvard University
pp. 799

Erratum to "Vickrey Pricing and Shortest Paths: What is an Edge Worth?" (PDF)

John Hershberger , Mentor Graphics Corp.
Subhash Suri , University of California at Santa Barbara
pp. 809
Author Index

Author Index (PDF)

pp. 811
85 ms
(Ver )