CSDL - Proceedings F

Program Committee (PDF)

pp. xiv

Reviewers (PDF)

pp. xv

TUTORIAL 1

Zero-Knowledge (PDF)

Oded Goldreich, Weizmann Institute of Science

pp. 3

TUTORIAL 2

Approximation Algorithms

TUTORIAL 3

Randomness Extractors and their Many Guises (PDF)

Salil P. Vadhan, Harvard University

pp. 9

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

PDF

Hardness Results for Coloring 3 -Colorable 3 -Uniform Hypergraphs (Abstract)

Subhash Khot, Princeton University

pp. 23

PDF

The Hardness of 3 -Uniform Hypergraph Coloring (Abstract)

Irit Dinur, Institute for Advanced Study

Oded Regev, Institute for Advanced Study

Clifford Smyth, Institute for Advanced Study

pp. 33

PDF

SESSION 1B

Minimizing Congestion in General Networks (Abstract)

Harald Räcke, Paderborn University

pp. 43

PDF

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

Stephen Alstrup, IT University of Copenhagen

Theis Rauhe, IT University of Copenhagen

pp. 53

PDF

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

Dariusz R. Kowalski, Uniwersytet Warszawski

Andrzej Pelc, Université du Québec á Hull

pp. 63

PDF

Explicit Unique-Neighbor Expanders (Abstract)

Noga Alon, Institute for Advanced Study and Tel Aviv University

Michael Capalbo, Institute for Advanced Study

pp. 73

PDF

SESSION 2A

Abstract Combinatorial Programs and Efficient Property Testers (Abstract)

Artur Czumaj, New Jersey Institute of Technology

Christian Sohler, University of Paderborn

pp. 83

PDF

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

Andrej Bogdanov, University of California at Berkeley

Kenji Obata, University of California at Berkeley

Luca Trevisan, University of California at Berkeley

pp. 93

PDF

Testing Juntas (Abstract)

Eldar Fischer, The Technion

Guy Kindler, Tel-Aviv University

Dana Ron, Tel-Aviv University

Shmuel Safra, Tel-Aviv University

Alex Samorodnitsky, Hebrew University of Jerusalem

pp. 103

PDF

A Spectral Algorithm for Learning Mixtures of Distributions (Abstract)

Santosh Vempala, Massachusetts Institute of Technology

Grant Wang, Massachusetts Institute of Technology

pp. 113

PDF

SESSION 2B

Equivalence between Priority Queues and Sorting (Abstract)

Mikkel Thorup, AT&T Labs-Research, Shannon Laboratory

pp. 125

PDF

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

Yijie Han, University of Missouri at Kansas City

Mikkel Thorup, AT&T Labs - Research Shannon Laboratory

pp. 135

PDF

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

Gianni Franceschini, Università di Pisa

Roberto Grossi, Università di Pisa

J. Ian Munro, University of Waterloo

Linda Pagli, Università di Pisa

pp. 145

PDF

An Inverse-Ackermann Style Lower Bound for the Online Minimum Spanning Tree Verification Problem (Abstract)

Seth Pettie, University of Texas at Austin

pp. 155

PDF

SESSION 3A

PAC = PAExact and Other Equivalent Models in Learning (Abstract)

Nader H. Bshouty, Technion

Dmitry Gavinsky, Technion

pp. 167

PDF

Learning Intersections and Thresholds of Halfspaces (Abstract)

Adam R. Klivans, Massachusetts Institute of Technology

Ryan O?Donnell, Massachusetts Institute of Technology

Rocco A. Servedio, Harvard University

pp. 177

PDF

On-Line Confidence Machines Are Well-Calibrated (Abstract)

Vladimir Vovk, University of London

pp. 187

PDF

Learning a Hidden Matching (Abstract)

Noga Alon, Institute for Advanced Study and Tel Aviv University

Richard Beigel, Temple University

Simon Kasif, Boston University

Steven Rudich, Carnegie-Mellon University

Benny Sudakov, Princeton University and Institute for Advanced Study

pp. 197

PDF

SESSION 3B

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

Ziv Bar-Yossef, IBM Almaden Research Center

T. S. Jayram, IBM Almaden Research Center

Ravi Kumar, IBM Almaden Research Center

D. Sivakumar, IBM Almaden Research Center

pp. 209

PDF

Static Optimality Theorem for External Memory String Access (Abstract)

Valentina Ciriani, University of Pisa

Paolo Ferragina, University of Pisa

Fabrizio Luccio, University of Pisa

S. Muthukrishnan, AT&T Labs - Research

pp. 219

PDF

A Simple Algorithmic Characterization of Uniform Solvability (Abstract)

Eli Gafni, University of California at Los Angeles

pp. 228

PDF

Correlation Clustering (Abstract)

Nikhil Bansal, Carnegie Mellon University

Avrim Blum, Carnegie Mellon University

Shuchi Chawla, Carnegie Mellon University

pp. 238

PDF

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

PDF

Breaking the O(n^1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval (Abstract)

Amos Beimel, Ben-Gurion University

Yuval Ishai, Technion

Eyal Kushilevitz, Technion

Jean-François Raymond, McGill University

pp. 261

PDF

LT Codes (Abstract)

Michael Luby, Digital Fountain, Inc.

pp. 271

PDF

SESSION 4B

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

Uriel Feige, Weizmann Institute of Science

Michael Langberg, Weizmann Institute of Science

Gideon Schechtman, Weizmann Institute of Science

pp. 283

PDF

Scheduling Over a Time-Varying User-Dependent Channel with Applications to High Speed Wireless Data (Abstract)

Matthew Andrews, Bell Labs

Lisa Zhang, Bell Labs

pp. 293

PDF

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

Naveen Garg, Indian Institute of Technology at New Delhi

Neal E. Young, Akamai Technologies

pp. 303

PDF

Proving Integrality Gaps without Knowing the Linear Program (Abstract)

Sanjeev Arora, Princeton University

Béla Bollobás, University of Memphis

László Lovász, Microsoft Research

pp. 313

PDF

Dependent Rounding in Bipartite Graphs (Abstract)

Rajiv Gandhi, University of Maryland at College Park

Samir Khuller, University of Maryland at College Park

Srinivasan Parthasarathy, University of Maryland at College Park

Aravind Srinivasan, University of Maryland at College Park

pp. 323

PDF

A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem (Abstract)

Amit Kumar, Cornell University

Anupam Gupta, Lucent Bell Labs

Tim Roughgarden, Cornell University

pp. 333

PDF

Constant-Round Coin-Tossing with a Man in the Middle or Realizing the Shared Random String Model (Abstract)

Boaz Barak, Weizmann Institute of Science

pp. 345

PDF

Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions from Worst-Case Complexity Assumptions (Abstract)

Daniele Micciancio, University of California at San Diego

pp. 356

PDF

Concurrent Zero Knowledge with Logarithmic Round-Complexity (Abstract)

Manoj Prabhakaran, Princeton University

Alon Rosen, Weizmann Institute of Science

Amit Sahai, Princeton University

pp. 366

PDF

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

Yevgeniy Dodis, New York University

Joel Spencer, New York University

pp. 376

PDF

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

Nikhil R. Devanur, University of California at Berkeley and ICSI Berkeley

Christos H. Papadimitriou, University of California at Berkeley

Amin Saberi, University of California at Berkeley and ICSI Berkeley

Vijay V. Vazirani, University of California at Berkeley and ICSI Berkeley

pp. 389

PDF

On the Hardness of Optimal Auctions (Abstract)

Amir Ronen, Stanford University and ICSI Berkeley

Amin Saberi, University of California at Berkeley and ICSI Berkeley

pp. 396

PDF

Auctions with Severely Bounded Communication (Abstract)

Liad Blumrosen, Hebrew University of Jerusalem

Noam Nisan, Hebrew University of Jerusalem

pp. 406

PDF

Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing and Auctions (Abstract)

Adrian Vetta, McGill University

pp. 416

PDF

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

Rahul Jain, STCS, Tata Institute of Fundamental Research

Jaikumar Radhakrishnan, STCS, Tata Institute of Fundamental Research

Pranab Sen, Université de Paris-Sud

pp. 429

PDF

Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes (Abstract)

Michael Alekhnovich, Massachusetts Institute of Technology

pp. 439

PDF

Authentication of Quantum Messages (Abstract)

Howard Barnum, Los Alamos National Laboratories

Claude Crépeau, McGill University

Daniel Gottesman, University of California at Berkeley

Adam Smith, Massachusetts Institute of Technology

Alain Tapp, Université de Montréal

pp. 449

PDF

Limits on the Power of Quantum Statistical Zero-Knowledge (Abstract)

John Watrous, University of Calgary

pp. 459

PDF

Protocols and Impossibility Results for Gossip-Based Communication Mechanisms (Abstract)

David Kempe, Cornell University

Jon Kleinberg, Cornell University

pp. 471

PDF

Covering Problems with Hard Capacities (Abstract)

Julia Chuzhoy, Technion

Joseph (Seffi) Naor, Technion

pp. 481

PDF

Packing 2-Dimensional Bins in Harmony (Abstract)

Alberto Caprara, University of Bologna

pp. 490

PDF

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

PDF

Quantum Lower Bounds for the Collision and the Element Distinctness Problems (Abstract)

Yaoyun Shi, University of Michigan

pp. 513

PDF

Quantum Computation and Lattice Problems (Abstract)

Oded Regev, Institute for Advanced Study

pp. 520

PDF

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

PDF

The Parameterized Complexity of Counting Problems (Abstract)

Jörg Flum, Albert-Ludwigs-Universität Freiburg

Martin Grohe, University of Edinburgh

pp. 538

PDF

Dimension Reduction in the \ell _1 Norm (Abstract)

Moses Charikar, Princeton University

Amit Sahai, Princeton University

pp. 551

PDF

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

PDF

Low-Dimensional Linear Programming with Violations (Abstract)

Timothy M. Chan, University of Waterloo

pp. 570

PDF

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

Josh Buresh-Oppenheim, University of Toronto

Paul Beame, University of Washington

Toniann Pitassi, University of Toronto

Ran Raz, Weizmann Institute of Science

Ashish Sabharwal, University of Washington

pp. 583

PDF

Satisfiability, Branch-Width and Tseitin Tautologies (Abstract)

Michael Alekhnovich, Massachusetts Institute of Technology

Alexander A. Razborov, Institute for Advanced Study

pp. 593

PDF

A Switching Lemma for Small Restrictions and Lower Bounds for k -DNF Resolution (Abstract)

pp. 604

PDF

Dynamic Planar Convex Hull (Abstract)

Gerth Stølting Brodal, University of Aarhus

Riko Jacob, University of Aarhus

pp. 617

PDF

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

PDF

The Partition Technique for Overlays of Envelopes (Abstract)

Vladlen Koltun, Tel Aviv University

Micha Sharir, Tel Aviv University

pp. 637

PDF

A Dichotomy Theorem for Constraints on a Three-Element Set (Abstract)

Andrei A. Bulatov, University of Oxford

pp. 649

PDF

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

Peter Bürgisser, University of Paderborn

Martin Lotz, University of Paderborn

pp. 659

PDF

Power from Random Strings (Abstract)

Eric Allender, Rutgers University

Harry Buhrman, CWI and University of Amsterdam

Michal Koucký, Rutgers University

Dieter van Melkebeek, University of Wisconsin

Detlef Ronneburger, Rutgers University

pp. 669

PDF

Improved Dynamic Reachability Algorithms for Directed Graphs (Abstract)

Liam Roditty, Tel Aviv University

Uri Zwick, Tel Aviv University

pp. 679

PDF

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

Guy Even, Tel-Aviv University

Zvi Lotker, Tel-Aviv University

Dana Ron, Tel-Aviv University

Shakhar Smorodinsky, Tel-Aviv University

pp. 691

PDF

Global Information from Local Observation (Abstract)

Itai Benjamini, Microsoft Research

László Lov´sz, Microsoft Research

pp. 701

PDF

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

Mary Cryan, University of Leeds

Martin Dyer, University of Leeds

Leslie Ann Goldberg, University of Warwick

Mark Jerrum, University of Edinburgh

Russell Martin, University of Warwick

pp. 711

PDF

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

Mark Jerrum, University of Edinburgh

Jung-Bae Son, University of Edinburgh

pp. 721

PDF

Random Lattices and a Conjectured 0 - 1 Law about Their Polynomial Time Computable Properties (Abstract)

Miklós Ajtai, IBM Almaden Research Center

pp. 733

PDF

Graph Isomorphism is in SPP (Abstract)

V. Arvind, Institute of Mathematical Sciences

Piyush P Kurur, Institute of Mathematical Sciences

pp. 743

PDF

Kolmogorov?s Structure Functions with an Application to the Foundations of Model Selection (Abstract)

Nikolai Vereshchagin, CWI and Moscow State University

Paul Vitányi, CWI

pp. 751

PDF

Forbidden Information (Abstract)

Leonid A. Levin, Institut Des Hautes Etudes Scientifiques and Boston University

pp. 761

PDF

SESSION 3

The 3-XORSAT Threshold (Abstract)

Olivier Dubois, Université Pierre et Marie Curie

Jacques Mandler, Université Pierre et Marie Curie

pp. 769

PDF

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

PDF

On Random Symmetric Travelling Salesman Problems (Abstract)

Alan Frieze, Carnegie Mellon University

pp. 789

PDF

Load Balancing with Memory (Abstract)

Michael Mitzenmacher, Harvard University

Balaji Prabhakar, Stanford University

Devavrat Shah, Stanford University

pp. 799

PDF

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