CSDL - Proceedings F

Conference Organization and Program Committee (PDF)

pp. xi

Reviewers (PDF)

pp. xii-xiv

Session 1

null

Quantum Weak Coin-Flipping with Bias of 0.192 (Abstract)

Carlos Mochon, California Institute of Technology

pp. 2-11

PDF

Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs (Abstract)

Hartmut Klauck, University of Calgary

Robert Špalek, CWI

Ronald de Wolf, CWI

pp. 12-21

PDF

Quantum Walk Algorithm for Element Distinctness (Abstract)

Andris Ambainis, Princeton University

pp. 22-31

PDF

Quantum Speed-Up of Markov Chain Based Algorithms (Abstract)

Mario Szegedy, Rutgers University

pp. 32-41

PDF

Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation (Abstract)

Dorit Aharonov, Hebrew University

Wim van Dam, Massachusetts Institute of Technology

Julia Kempe, Université de Paris-Sud

Zeph Landau, City College of New York

Seth Lloyd, Massachusetts Institute of Technology

Oded Regev, Tel-Aviv University

pp. 42-51

PDF

Session 2

null

Maximizing Quadratic Programs: Extending Grothendieck's Inequality (Abstract)

Moses Charikar, Princeton University

Anthony Wirth, Princeton University

pp. 54-60

PDF

An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem (Abstract)

Lap Chi Lau, University of Toronto

pp. 61-70

PDF

Edge-Disjoint Paths in Planar Graphs (Abstract)

C. Chekuri, Bell Labs

S. Khanna, University of Pennsylvania

F. B. Shepherd, Bell Labs

pp. 71-80

PDF

Machine Minimization for Scheduling Jobs with Interval Constraints (Abstract)

Julia Chuzhoy, Technion

Sudipto Guha, University of Pennsylvania

Sanjeev Khanna, University of Pennsylvania

Joseph (Seffi) Naor, Technion

pp. 81-90

PDF

Session 3

null

Random Edge Can Be Exponential on Abstract Cubes (Abstract)

Jiří Matoušek, Charles University and ETH Zentrum

Tibor Szabó, ETH Zentrum

pp. 92-100

PDF

On the Integrality Ratio for Asymmetric TSP (Abstract)

Moses Charikar, Princeton University

Michel X. Goemans, Massachusetts Institute of Technology

Howard Karloff, AT&T Labs

pp. 101-107

PDF

The Hardness of Metric Labeling (Abstract)

Julia Chuzhoy, Technion

Joseph (Seffi) Naor, Technion

pp. 108-114

PDF

Hardness of Buy-at-Bulk Network Design (Abstract)

Matthew Andrews, Bell Laboratories

pp. 115-124

PDF

Session 4

null

Hardness of Approximating the Shortest Vector Problem in Lattices (Abstract)

Subhash Khot, Georgia Tech University

pp. 126-135

PDF

Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique (Abstract)

Subhash Khot, Georgia Tech University

pp. 136-145

PDF

Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs? (Abstract)

Subhash Khot, Institute for Advanced Study

Guy Kindler, Rutgers University

Elchanan Mossel, University of California at Berkeley

Ryan O'Donnell, Institute for Advanced Study

pp. 146-154

PDF

Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem (Abstract)

Irit Dinur, University of California at Berkeley

Omer Reingold, Weizmann Institute

pp. 155-164

PDF

Session 5

null

Cryptography in NC⁰ (Abstract)

Benny Applebaum, Technion

Yuval Ishai, Technion

Eyal Kushilevitz, Technion

pp. 166-175

PDF

An Unconditional Study of Computational Zero Knowledge (Abstract)

Salil P. Vadhan, Harvard University

pp. 176-185

PDF

Universally Composable Protocols with Relaxed Set-Up Assumptions (Abstract)

Boaz Barak, Institute for Advanced Study

Ran Canetti, IBM Research

Jesper Buus Nielsen, ETH Z?urich

Rafael Pass, Massachusetts Institute of Technology

pp. 186-195

PDF

On the (Im)possibility of Cryptography with Imperfect Randomness (Abstract)

Yevgeniy Dodis, New York University

Shien Jin Ong, Harvard University

Manoj Prabhakaran, Princeton University and University of California at Los Angeles

Amit Sahai, Princeton University and University of California at Los Angeles

pp. 196-205

PDF

Session 6

null

Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity (Abstract)

Brian C. Dean, Massachusetts Institute of Technology

Michel X. Goemans, Massachusetts Institute of Technology

Jan Vondrák, Massachusetts Institute of Technology

pp. 208-217

PDF

An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design (Abstract)

Anupam Gupta, Carnegie Mellon University

R. Ravi, Carnegie Mellon University

Amitabh Sinha, University of Michigan

pp. 218-227

PDF

Stochastic Optimization is (Almost) as easy as Deterministic Optimization (Abstract)

David B. Shmoys, Cornell University

Chaitanya Swamy, Cornell University

pp. 228-237

PDF

0(\sqrt {\log n)} Approximation to SPARSEST CUT in ?(n²) Time (Abstract)

Sanjeev Arora, Princeton University

Elad Hazan, Princeton University

Satyen Kale, Princeton University

pp. 238-247

PDF

Maximum Matchings via Gaussian Elimination (Abstract)

Marcin Mucha, Warsaw University

Piotr Sankowski, Warsaw University

pp. 248-255

PDF

Session 7

null

Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game (Abstract)

Rahul Savani, London School of Economics

Bernhard von Stengel, London School of Economics

pp. 258-267

PDF

Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users (Abstract)

George Karakostas, McMaster University

Stavros G. Kolliopoulos, University of Athens and McMaster University

pp. 268-276

PDF

Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games (Abstract)

Lisa Fleischer, IBM T. J. Watson Research Center

Kamal Jain, Microsoft Research

Mohammad Mahdian, Microsoft Research

pp. 277-285

PDF

A Polynomial Time Algorithm for Computing the Arrow-Debreu Market Equilibrium for Linear Utilities (Abstract)

Kamal Jain, Microsoft Research

pp. 286-294

PDF

The Price of Stability for Network Design with Fair Cost Allocation (Abstract)

Elliot Anshelevich, Cornell University

Anirban Dasgupta, Cornell University

Jon Kleinberg, Cornell University

Éva Tardos, Cornell University

Tom Wexler, Cornell University

Tim Roughgarden, University of California at Berkeley

pp. 295-304

PDF

Session 8

null

Holographic Algorithms (Extended Abstract) (Abstract)

Leslie G. Valiant, Harvard University

pp. 306-315

PDF

Hierarchy Theorems for Probabilistic Polynomial Time (Abstract)

Lance Fortnow, University of Chicago

Rahul Santhanam, University of Chicago

pp. 316-324

PDF

Private Codes or Succinct Random Codes That Are (Almost) Perfect (Abstract)

Michael Langberg, California Institute of Technology

pp. 325-334

PDF

On the List and Bounded Distance Decodibility of the Reed-Solomon Codes (Extended Abstract) (Abstract)

Qi Cheng, University of Oklahoma

Daqing Wan, University of California at Irvine and Chinese Academy of Sciences

pp. 335-341

PDF

Session 9

null

Multilinear- NC₁ ≠ Multilinear- NC₂ (Abstract)

Ran Raz, Weizmann Institute

pp. 344-351

PDF

Algebras with Polynomial Identities and Computing the Determinant (Abstract)

Steve Chien, Microsoft Research

Alistair Sinclair, University of California at Berkeley

pp. 352-361

PDF

Lattice Problems in NP ∩ coNP (Abstract)

Dorit Aharonov, Hebrew University

Oded Regev, Tel-Aviv University

pp. 362-371

PDF

Worst-Case to Average-Case Reductions Based on Gaussian Measures (Abstract)

Daniele Micciancio, University of California at San Diego

Oded Regev, Tel-Aviv University

pp. 372-381

PDF

Session 10

null

Extracting Randomness Using Few Independent Sources (Abstract)

Boaz Barak, Institute for Advanced Study

Russell Impagliazzo, University of California at San Diego

Avi Wigderson, Institute for Advanced Study

pp. 384-393

PDF

Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed (Abstract)

Ariel Gabizon, Weizmann Institute

Ran Raz, Weizmann Institute

Ronen Shaltiel, Weizmann Institute

pp. 394-403

PDF

Constructing Expander Graphs by 2-Lifts and Discrepancy vs. Spectral Gap (Abstract)

Yonatan Bilu, Hebrew University

Nathan Linial, Hebrew University

pp. 404-412

PDF

Testing Polynomials over General Fields (Abstract)

Tali Kaufman, Tel Aviv University

Dana Ron, Tel Aviv University

pp. 413-422

PDF

Testing Low-Degree Polynomials over Prime Fields (Abstract)

Charanjit S. Jutla, IBM Thomas J. Watson Research Center

Anindya C. Patthak, University of Texas at Austin

Atri Rudra, University of Washington

David Zuckerman, University of Texas at Austin

pp. 423-432

PDF

Session 11

null

Measured Descent: A New Embedding Method for Finite Metrics (Abstract)

Robert Krauthgamer, IBM Almaden Research Center

James R. Lee, University of California at Berkeley

Manor Mendel, University of Illinois at Urbana-Champaign

Assaf Naor, Microsoft Research

pp. 434-443

PDF

Triangulation and Embedding Using Small Sets of Beacons (Abstract)

Jon Kleinberg, Cornell University

Aleksandrs Slivkins, Cornell University

Tom Wexler, Cornell University

pp. 444-453

PDF

A Simple Linear Time (1+ ∊) -Approximation Algorithm for k-Means Clustering in Any Dimensions (Abstract)

Amit Kumar, IIT Delhi

Yogish Sabharwal, IBM India Research Lab and IIT Delhi

Sandeep Sen, IIT Delhi

pp. 454-462

PDF

On the Power of Discrete and of Lexicographic Helly-Type Theorems (Abstract)

Nir Halman, Tel Aviv University

pp. 463-472

PDF

An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching (Abstract)

Amit Chakrabarti, Dartmouth College

Oded Regev, Tel Aviv University

pp. 473-482

PDF

Session 12

null

Dynamic Optimality — Almost (Abstract)

Erik D. Demaine, Massachusetts Institute of Technology

Dion Harmon, Massachusetts Institute of Technology

John Iacono, Polytechnic University

Mihai Pătraşcu, Massachusetts Institute of Technology

pp. 484-490

PDF

No Sorting? Better Searching! (Abstract)

Gianni Franceschini, Università di Pisa

Roberto Grossi, Università di Pisa

pp. 491-498

PDF

Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs (Abstract)

Liam Roditty, Tel Aviv University

Uri Zwick, Tel Aviv University

pp. 499-508

PDF

Dynamic Transitive Closure via Dynamic Matrix Inverse (Extended Abstract) (Abstract)

Piotr Sankowski, Warsaw University

pp. 509-517

PDF

Session 13

null

Dynamic Speed Scaling to Manage Energy and Temperature (Abstract)

Nikhil Bansal, IBM T. J. Watson Research Center

Tracy Kimbrel, IBM T. J. Watson Research Center

Kirk Pruhs, University of Pittsburgh

pp. 520-529

PDF

Optimal Power-Down Strategies (Abstract)

John Augustine, University of California at Irvine

Sandy Irani, University of California at Irvine

Chaitanya Swamy, Cornell University

pp. 530-539

PDF

On the Streaming Model Augmented with a Sorting Primitive (Abstract)

Gagan Aggarwal, Stanford University

Mayur Datar, Google

Sridhar Rajagopalan, IBM Almaden

Matthias Ruhl, Google

pp. 540-549

PDF

Approximating Edit Distance Efficiently (Abstract)

Ziv Bar-Yossef, Technion

T. S. Jayram, IBM Almaden Research Center

Robert Krauthgamer, IBM Almaden Research Center

Ravi Kumar, IBM Almaden Research Center

pp. 550-559

PDF

Session 14

null

Strong Spatial Mixing for Lattice Graphs with Fewer Colours (Abstract)

Leslie Ann Goldberg, University of Warwick

Russell Martin, University of Warwick

Mike Paterson, University of Warwick

pp. 562-571

PDF

Shuffling by Semi-Random Transpositions (Abstract)

Elchanan Mossel, University of California at Berkeley

Yuval Peres, University of California at Berkeley

Alistair Sinclair, University of California at Berkeley

pp. 572-581

PDF

Randomly Coloring Constant Degree Graphs (Abstract)

Martin Dyer, University of Leeds

Alan Frieze, Carnegi Mellon University

Thomas P. Hayes, Toyota Technological Institute at Chicago and University of Chicago

Eric Vigoda, Toyota Technological Institute at Chicago and University of Chicago

pp. 582-589

PDF

The Exact Satisfiability Threshold for a Potentially Intractible Random Constraint Satisfaction Problem (Abstract)

Harold Connamacher, University of Toronto

Michael Molloy, University of Toronto

pp. 590-599

PDF

Session 15

null

Spectral Analysis of Random Graphs with Skewed Degree Distributions (Abstract)

Anirban Dasgupta, Cornell University

John E. Hopcroft, Cornell University

Frank McSherry, Microsoft Research

pp. 602-610

PDF

Learning with Errors in Answers to Membership Queries (Extracted Abstract) (Abstract)

Laurence Bisht, Technion

Nader H. Bshouty, Technion

Lawrance Khoury, Technion

pp. 611-620

PDF

Learnability and Automatizability (Abstract)

Misha Alekhnovich, Institute for Advanced Studies

Mark Braverman, University of Toronto

Vitaly Feldman, Harvard University

Adam R. Klivans, Toyota Technological Institute

Toniann Pitassi, Institute for Advanced Studies and University of Toronto

pp. 621-630

PDF

Author Index

Author Index (PDF)

pp. 631-632