CSDL - Proceedings F

46th Annual IEEE Symposium on Foundations of Computer Science- Copyright (PDF)

pp. iv

Introduction

Foreword (PDF)

pp. x

Committees (PDF)

pp. xi

Best Paper Awards (PDF)

pp. xi

Machtey Award (PDF)

pp. xi

Knuth Prize (PDF)

pp. xi

Reviewers (PDF)

pp. xii

Corporate Sponsors (PDF)

pp. xiii

Tutorial 1

On the Unique Games Conjecture (PDF)

Subhash Khot, Georgia Inst. of Technology

pp. 3

Tutorial 2

Algorithmic Techniques and Tools from Computational Geometry (PDF)

Bernard Chazelle, Department of Computer Science Princeton University

pp. 7

Session 1

Agnostically Learning Halfspaces (Abstract)

Adam Tauman Kalai, TTI-Chicago

Adam R. Klivans, UT-Austin

Yishay Mansour, Tel Aviv University

Rocco A. Servedio, Columbia University

pp. 11-20

PDF

Noise stability of functions with low in.uences invariance and optimality (Abstract)

Elchanan Mossel, U.C. Berkeley

Ryan O?Donnell, Microsoft Research

Krzysztof Oleszkiewicz, Warsaw University

pp. 21-30

PDF

Every decision tree has an influential variable (Abstract)

Ryan O'Donnell, Microsoft Research

Michael Saks, Rutgers University

Oded Schramm, Microsoft Research

Rocco A. Servedio, Columbia University

pp. 31-39

PDF

Lower Bounds for the Noisy Broadcast Problem (Abstract)

Navin Goyal, Dept. of Computer Science Rutgers University

Guy Kindler, Princeton University

Michael Saks, Dept. of Mathematics Rutgers University

pp. 40-52

PDF

Session 2 Best Paper Award:

The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into \ell 1 (Abstract)

Subhash A. Khot, College of Computing, Georgia Tech

Nisheeth K. Vishnoi, IBM India Research Lab, New Delhi, India

pp. 53-62

PDF

The Closest Substring problem with small distances (Abstract)

Daniel Marx, Budapest University, Hungary

pp. 63-72

PDF

Fitting tree metrics: Hierarchical clustering and Phylogeny (Abstract)

Nir Ailon, Princeton University

Moses Charikar, Princeton University

pp. 73-82

PDF

Metric Embeddings with Relaxed Guarantees (Abstract)

Ittai Abraham, Ittai Abraham

Yair Bartal, Yair Bartal

T-H. Hubert Chan, T-H. Hubert Chan

Kedar Dhamdhere Dhamdhere, Kedar Dhamdhere

Anupam Gupta, Anupam Gupta

Jon Kleinberg, Jon Kleinberg

Ofer Neiman, Ofer Neiman

Aleksandrs Slivkins, Aleksandrs Slivkins

pp. 83-100

PDF

Nonembeddability theorems via Fourier analysis (Abstract)

Subhash Khot, Georgia Institute of Technology

Assaf Naor, Microsoft Corporation Theory Group, Microsoft Research

pp. 101-112

PDF

Session 3 Machtey Award

On the Complexity of Two-PlayerWin-Lose Games (Abstract)

Tim Abbott, MIT

Daniel Kane, MIT

Paul Valiant, MIT, Computer Science and Artificial Intelligence Laboratory

pp. 113-122

PDF

Nash Equilibria in Random Games (Abstract)

Imre Barany, Imre Barany

Santosh Vempala, MIT

Adrian Vetta, Adrian Vetta

pp. 123-131

PDF

Query Incentive Networks (Abstract)

Jon Kleinberg, Jon Kleinberg

Prabhakar Raghavan

pp. 132-141

PDF

Sink Equilibria and Convergence (Abstract)

Michel Goemans, MIT

Vahab Mirrokni, MIT

Adrian Vetta, McGill University

pp. 142-154

PDF

Session 4 Machtey Award Paper

On the Complexity of Real Functions (Abstract)

Mark Braverman, University of Toronto

pp. 155-164

PDF

Linear Lower Bounds on Real-World Implementations of Concurrent Objects (Abstract)

Faith Ellen Fich, University of Toronto

Danny Hendler, University of Toronto

Nir Shavit, Sun Microsystems Laboratories

pp. 165-173

PDF

Towards a Final Analysis of Pairing Heaps (Abstract)

Seth Pettie, Max Planck Institut fur Informatik

pp. 174-183

PDF

Structuring labeled trees for optimal succinctness, and beyond (Abstract)

Paolo Ferragina, University of Pisa

Fabrizio Luccio, University of Pisa

Giovanni Manzini, University of Piemonte Orientale

S. Muthukrishnan, Rutgers University

pp. 184-196

PDF

Session 5

Approximation Algorithms for Unique Games (Abstract)

Luca Trevisan, U.C. Berkeley

pp. 197-205

PDF

On Non-Approximability for Quadratic Programs (Abstract)

Sanjeev Arora, Computer Science Department, Princeton University

Eli Berger, Institute for Advanced Study, Princeton University

Guy Kindler, Institute for Advanced Study, Princeton University

Muli Safra, Institute for Advanced Study, Princeton University

Elad Hazan, Computer Science Department,Princeton University

pp. 206-215

PDF

Hardness of Approximating the Closest Vector Problem with Pre-Processing (Abstract)

Mikhail Alekhnovich, Mikhail Alekhnovich

Subhash A. Khot, Subhash A. Khot

Guy Kindler

Nisheeth K. Vishnoi, Nisheeth K. Vishnoi

pp. 216-225

PDF

Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion (Abstract)

Matthew Andrews, Bell Laboratories, Lucent Technologies,

Julia Chuzhoy, CSAIL, MIT and Dept. of CIS, University of Pennsylvania,

Sanjeev Khanna, Dept. of CIS, University of Pennsylvania,

Lisa Zhang, Bell Laboratories, Lucent Technologies

pp. 226-244

PDF

Session 6

A Recursive Greedy Algorithm for Walks in Directed Graphs (Abstract)

Chandra Chekuri, Chandra Chekuri

Martin Pal, Martin Pal

pp. 245-253

PDF

Approximation Algorithms for Scheduling on Multiple Machines (PDF)

V.S. Anil Kumar, Virginia Tech

Madhav V. Marathe, Virginia Tech

Srinivasan Parthasarathy, University of Maryland

Aravind Srinivasan, University of Maryland

pp. 254-263

AdWords and Generalized On-line Matching (Abstract)

Aranyak Mehta, Aranyak Mehta

Amin Saberi, Amin Saberi

Umesh Vazirani, Umesh Vazirani

Vijay Vazirani, Vijay Vazirani

pp. 264-273

PDF

The Parking Permit Problem (Abstract)

Adam Meyerson Meyerson, University of California, Los Angeles

pp. 274-284

PDF

Session 7 Best Paper Award

Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time (Abstract)

Farzad Parvaresh, University of California San Diego

Alexander Vardy, University of California San Diego

pp. 285-294

PDF

Error Correction via Linear Programming (Abstract)

Emmanuel Candes, Caltech

Mark Rudelson, University of Missouri

Terence Tao, UCLA

Roman Vershynin, University of California, Davis

pp. 295-308

PDF

Error-Correcting Codes for Automatic Control (Abstract)

Rafail Ostrovsky, Rafail Ostrovsky

Yuval Rabani, Yuval Rabani

Leonard J. Schulman, Leonard J. Schulman

pp. 309-316

PDF

Almost Orthogonal Linear Codes are Locally Testable (Abstract)

Tali Kaufman, School of Computer Science, Tel Aviv University

Simon Litsyn, Department of Electrical Engineering-Systems,Tel Aviv University

pp. 317-326

PDF

On Delsarte?s Linear Programming Bounds for Binary Codes (Abstract)

Michael Navon, The Hebrew University of Jerusalem

Alex Samorodnitsky, The Hebrew University of Jerusalem

pp. 327-338

PDF

Session 8

Fast Algorithms for Approximate Semide.nite Programming using the Multiplicative Weights Update Method (Abstract)

Sanjeev Arora, Princeton University

Elad Hazan, Princeton University

Satyen Kale, Princeton University

pp. 339-348

PDF

Improved Smoothed Analysis of the Shadow Vertex Simplex Method (Abstract)

Amit Deshpande, MIT

Daniel A. Spielman, Yale University

pp. 349-356

PDF

Sampling-based Approximation Algorithms for Multi-stage Stochastic (Abstract)

Chaitanya Swamy, Caltech

David B. Shmoys, Cornell Univerisity

pp. 357-366

PDF

How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems (Abstract)

Kedar Dhamdhere, Google Inc.

Vineet Goyal, Carnegie Mellon University

R. Ravi, Carnegie Mellon University

Mohit Singh, Carnegie Mellon University

pp. 367-378

PDF

Session 9

Group-theoretic Algorithms for Matrix Multiplication (Abstract)

Henry Cohn, Henry Cohn

Robert Kleinberg, Robert Kleinberg

Balazs Szegedy, Balazs Szegedy

Christopher Umans, Christopher Umans

pp. 379-388

PDF

Answering distance queries in directed graphs using fast matrix multiplication (Abstract)

Raphael Yuster, University of Haifa

Uri Zwick, Tel Aviv University

pp. 389-396

PDF

A Randomness-Efficient Sampler for Matrix-valued Functions and Applications (Abstract)

Avi Wigderson, Institute for Advanced Study, Princeton Univeristy

David Xiao, Princeton Univeristy

pp. 397-406

PDF

Deterministic Extractors for Affine Sources over Large Fields (Abstract)

Ariel Gabizon, Weizmann Institute

Ran Raz, Weizmann Institute

pp. 407-418

PDF

Session 10

Additive Approximation for Edge-Deletion Problems (Abstract)

Noga Alon, Tel-Aviv University

Asaf Shapira, Tel-Aviv University

Benny Sudakov, Princeton University

pp. 419-428

PDF

A Characterization of the (natural) Graph Properties Testable with One-Sided Error (Abstract)

Noga Alon, Tel-Aviv University

Asaf Shapira, Tel-Aviv University

pp. 429-438

PDF

An Algorithmic Version of the Hypergraph Regularity Method (Abstract)

P.E. Haxell, University of Waterloo

B. Nagle, University of Nevada

V. Rodl, Emory University

pp. 439-448

PDF

Session 11

Cryptography In the Bounded Quantum-Storage Model (Abstract)

Ivan B. Damgard, Ivan B. Damgard

Serge Fehr, Serge Fehr

Louis Salvail, Louis Salvail

Christian Schaffner, Christian Schaffner

pp. 449-458

PDF

Quantum Information and the PCP Theorem (Abstract)

Ran Raz, Weizmann Institute

pp. 459-468

PDF

From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups (Abstract)

Dave Bacon, Dave Bacon

Andrew M. Childs, Andrew M. Childs

Wim van Dam, Wim van Dam

pp. 469-478

PDF

The Symmetric Group Defies Strong Fourier Sampling (Abstract)

Cristopher Moore, U. New Mexico

Alexander Russell, U. Connecticut

Leonard J. Schulman, Caltech

pp. 479-490

PDF

Session 12

On Learning Mixtures of Heavy-Tailed Distributions (Abstract)

Anirban Dasgupta, Anirban Dasgupta

John Hopcroft, John Hopcroft

Jon Kleinberg, Jon Kleinberg

Mark Sandler, Mark Sandler

pp. 491-500

PDF

Learning mixtures of product distributions over discrete domains (Abstract)

Jon Feldman, Columbia University

Ryan ODonnell, Microsoft Research

Rocco A. Servedio, Dept. of Computer Science, Columbia University

pp. 501-510

PDF

A general lower bound for mixing of single-site dynamics on graphs (Abstract)

Thomas P. Hayes, Thomas P. Hayes

Alistair Sinclair, Alistair Sinclair

pp. 511-520

PDF

Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion (Extended Abstract) (Abstract)

Tomas Brazdil, Masaryk University

Javier Esparza, University of Stuttgart,

Antonin Kucera, Masaryk University

pp. 521-530

PDF

Safraless Decision Procedures (Abstract)

Orna Kupferman, Hebrew University

Moshe Y. Vardi, Rice University

pp. 531-542

PDF

Session 13

How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation (Abstract)

Boaz Barak, Princeton University

Amit Sahai, UCLA

pp. 543-552

PDF

On the Impossibility of Obfuscation with Auxiliary Input (Abstract)

Shafi Goldwasser, The Weizmann Institute

Yael Tauman Kalai, MIT

pp. 553-562

PDF

Concurrent Non-Malleable Commitments (Abstract)

Rafael Pass, MIT

Alon Rosen, Harvard

pp. 563-572

PDF

The Complexity of Online Memory Checking (Abstract)

Moni Naor, Weizmann Institute of Science

Guy N. Rothblum, Weizmann Institute of Science

pp. 573-584

PDF

Session 14

Rational Secure Computation and Ideal Mechanism Design (Abstract)

Sergei Izmalkov, Dept of Economics, MIT

Silvio Micali, CSAIL, MIT

Matt Lepinski, CSAIL, MIT

pp. 585-595

PDF

Truthful and Near-Optimal Mechanism Design via Linear Programming (Abstract)

Ron Lavi, Caltech

Chaitanya Swamy, Caltech

pp. 595-604

PDF

Mechanism Design via Machine Learning (Abstract)

Maria-Florina Balcan, Carnegie Mellon University

Avrim Blum, Carnegie Mellon University

pp. 605-614

PDF

Beyond VCG: Frugality of Truthful Mechanisms (Abstract)

Anna R. Karlin, University of Washington

David Kempe, University of Southern California

Tami Tamir, The Interdisciplinary Center, Herzliya, Israel

pp. 615-626

PDF

Session 15

An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs (Abstract)

Jon Kleinberg, Jon Kleinberg

pp. 627-636

PDF

Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring (Abstract)

Erik D. Demaine, Erik D. Demaine

Mohammad Taghi Hajiaghayi, Mohammad Taghi Hajiaghayi

Ken-ichi Kawarabayashi, Ken-ichi Kawarabayashi

pp. 637-646

PDF

A linear-time approximation scheme for planar weighted TSP (Abstract)

Philip N. Klein, Brown University

pp. 647-657

PDF

A Tale of Two Dimensional Bin Packing (Abstract)

Nikhil Bansal, IBM TJ Watson, NY

Andrea Lodi, Univ. of Bolgna, Italy

Maxim Sviridenko, IBM TJ Watson, NY

pp. 657-666

PDF

Author Index

Author Index (PDF)

pp. 667