The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (2004)
Rome, Italy
Oct. 17, 2004 to Oct. 19, 2004
ISSN: 0272-5428
ISBN: 0-7695-2228-9
TABLE OF CONTENTS
Introduction

Foreword (PDF)

pp. x
Session 1

null (PDF)

pp. null

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

Carlos Mochon , California Institute of Technology
pp. 2-11

Quantum Walk Algorithm for Element Distinctness (Abstract)

Andris Ambainis , Princeton University
pp. 22-31

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

Seth Lloyd , Massachusetts Institute of Technology
Dorit Aharonov , Hebrew University
Wim van Dam , Massachusetts Institute of Technology
Oded Regev , Tel-Aviv University
Zeph Landau , City College of New York
Julia Kempe , Université de Paris-Sud
pp. 42-51
Session 2

null (PDF)

pp. null

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

Anthony Wirth , Princeton University
Moses Charikar , Princeton University
pp. 54-60

Edge-Disjoint Paths in Planar Graphs (Abstract)

C. Chekuri , Bell Labs
S. Khanna , University of Pennsylvania
F. B. Shepherd , Bell Labs
pp. 71-80

Machine Minimization for Scheduling Jobs with Interval Constraints (Abstract)

Sanjeev Khanna , University of Pennsylvania
Sudipto Guha , University of Pennsylvania
Julia Chuzhoy , Technion
pp. 81-90
Session 3

null (PDF)

pp. null

Random Edge Can Be Exponential on Abstract Cubes (Abstract)

Tibor Szabó , ETH Zentrum
Jiří Matoušek , Charles University and ETH Zentrum
pp. 92-100

On the Integrality Ratio for Asymmetric TSP (Abstract)

Howard Karloff , AT&T Labs
Michel X. Goemans , Massachusetts Institute of Technology
Moses Charikar , Princeton University
pp. 101-107

The Hardness of Metric Labeling (Abstract)

Julia Chuzhoy , Technion
pp. 108-114

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

Matthew Andrews , Bell Laboratories
pp. 115-124
Session 4

null (PDF)

pp. null

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

Subhash Khot , Institute for Advanced Study
Elchanan Mossel , University of California at Berkeley
Ryan O'Donnell , Institute for Advanced Study
Guy Kindler , Rutgers University
pp. 146-154

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
Session 5

null (PDF)

pp. null

Cryptography in NC⁰ (Abstract)

Benny Applebaum , Technion
Yuval Ishai , Technion
Eyal Kushilevitz , Technion
pp. 166-175

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

Rafael Pass , Massachusetts Institute of Technology
Jesper Buus Nielsen , ETH Z?urich
Boaz Barak , Institute for Advanced Study
Ran Canetti , IBM Research
pp. 186-195

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

Yevgeniy Dodis , New York University
Amit Sahai , Princeton University and University of California at Los Angeles
Manoj Prabhakaran , Princeton University and University of California at Los Angeles
Shien Jin Ong , Harvard University
pp. 196-205
Session 6

null (PDF)

pp. null

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

Jan Vondrák , Massachusetts Institute of Technology
Michel X. Goemans , Massachusetts Institute of Technology
Brian C. Dean , Massachusetts Institute of Technology
pp. 208-217

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

Amitabh Sinha , University of Michigan
Anupam Gupta , Carnegie Mellon University
R. Ravi , Carnegie Mellon University
pp. 218-227

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

Maximum Matchings via Gaussian Elimination (Abstract)

Piotr Sankowski , Warsaw University
Marcin Mucha , Warsaw University
pp. 248-255
Session 7

null (PDF)

pp. 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

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

Stavros G. Kolliopoulos , University of Athens and McMaster University
George Karakostas , McMaster University
pp. 268-276

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

Kamal Jain , Microsoft Research
Mohammad Mahdian , Microsoft Research
Lisa Fleischer , IBM T. J. Watson Research Center
pp. 277-285

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

Tim Roughgarden , University of California at Berkeley
Jon Kleinberg , Cornell University
Éva Tardos , Cornell University
Elliot Anshelevich , Cornell University
Tom Wexler , Cornell University
Anirban Dasgupta , Cornell University
pp. 295-304
Session 8

null (PDF)

pp. null

Holographic Algorithms (Extended Abstract) (Abstract)

Leslie G. Valiant , Harvard University
pp. 306-315

Hierarchy Theorems for Probabilistic Polynomial Time (Abstract)

Lance Fortnow , University of Chicago
Rahul Santhanam , University of Chicago
pp. 316-324

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

Michael Langberg , California Institute of Technology
pp. 325-334

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
Session 9

null (PDF)

pp. null

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

Ran Raz , Weizmann Institute
pp. 344-351

Algebras with Polynomial Identities and Computing the Determinant (Abstract)

Steve Chien , Microsoft Research
Alistair Sinclair , University of California at Berkeley
pp. 352-361

Lattice Problems in NP ∩ coNP (Abstract)

Oded Regev , Tel-Aviv University
Dorit Aharonov , Hebrew University
pp. 362-371

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

Oded Regev , Tel-Aviv University
Daniele Micciancio , University of California at San Diego
pp. 372-381
Session 10

null (PDF)

pp. null

Extracting Randomness Using Few Independent Sources (Abstract)

Russell Impagliazzo , University of California at San Diego
Avi Wigderson , Institute for Advanced Study
Boaz Barak , Institute for Advanced Study
pp. 384-393

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

Ran Raz , Weizmann Institute
Ronen Shaltiel , Weizmann Institute
Ariel Gabizon , Weizmann Institute
pp. 394-403

Testing Polynomials over General Fields (Abstract)

Dana Ron , Tel Aviv University
Tali Kaufman , Tel Aviv University
pp. 413-422

Testing Low-Degree Polynomials over Prime Fields (Abstract)

Atri Rudra , University of Washington
Anindya C. Patthak , University of Texas at Austin
David Zuckerman , University of Texas at Austin
Charanjit S. Jutla , IBM Thomas J. Watson Research Center
pp. 423-432
Session 11

null (PDF)

pp. null

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

Manor Mendel , University of Illinois at Urbana-Champaign
Assaf Naor , Microsoft Research
Robert Krauthgamer , IBM Almaden Research Center
James R. Lee , University of California at Berkeley
pp. 434-443

Triangulation and Embedding Using Small Sets of Beacons (Abstract)

Aleksandrs Slivkins , Cornell University
Tom Wexler , Cornell University
Jon Kleinberg , Cornell University
pp. 444-453
Session 12

null (PDF)

pp. null

Dynamic Optimality — Almost (Abstract)

Mihai Pătraşcu , Massachusetts Institute of Technology
Erik D. Demaine , Massachusetts Institute of Technology
Dion Harmon , Massachusetts Institute of Technology
John Iacono , Polytechnic University
pp. 484-490

No Sorting? Better Searching! (Abstract)

Roberto Grossi , Università di Pisa
Gianni Franceschini , Università di Pisa
pp. 491-498

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

Uri Zwick , Tel Aviv University
Liam Roditty , Tel Aviv University
pp. 499-508
Session 13

null (PDF)

pp. null

Dynamic Speed Scaling to Manage Energy and Temperature (Abstract)

Kirk Pruhs , University of Pittsburgh
Tracy Kimbrel , IBM T. J. Watson Research Center
Nikhil Bansal , IBM T. J. Watson Research Center
pp. 520-529

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

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

Matthias Ruhl , Google
Gagan Aggarwal , Stanford University
Mayur Datar , Google
Sridhar Rajagopalan , IBM Almaden
pp. 540-549

Approximating Edit Distance Efficiently (Abstract)

T. S. Jayram , IBM Almaden Research Center
Ravi Kumar , IBM Almaden Research Center
Ziv Bar-Yossef , Technion
Robert Krauthgamer , IBM Almaden Research Center
pp. 550-559
Session 14

null (PDF)

pp. null

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

Leslie Ann Goldberg , University of Warwick
Mike Paterson , University of Warwick
Russell Martin , University of Warwick
pp. 562-571

Shuffling by Semi-Random Transpositions (Abstract)

Yuval Peres , University of California at Berkeley
Alistair Sinclair , University of California at Berkeley
Elchanan Mossel , University of California at Berkeley
pp. 572-581

Randomly Coloring Constant Degree Graphs (Abstract)

Alan Frieze , Carnegi Mellon University
Eric Vigoda , Toyota Technological Institute at Chicago and University of Chicago
Thomas P. Hayes , Toyota Technological Institute at Chicago and University of Chicago
Martin Dyer , University of Leeds
pp. 582-589
Session 15

null (PDF)

pp. null

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

John E. Hopcroft , Cornell University
Frank McSherry , Microsoft Research
Anirban Dasgupta , Cornell University
pp. 602-610

Learnability and Automatizability (Abstract)

Adam R. Klivans , Toyota Technological Institute
Vitaly Feldman , Harvard University
Toniann Pitassi , Institute for Advanced Studies and University of Toronto
Mark Braverman , University of Toronto
Misha Alekhnovich , Institute for Advanced Studies
pp. 621-630
Author Index

Author Index (PDF)

pp. 631-632
98 ms
(Ver )