The Community for Technology Leaders
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) (2006)
Berkeley, California
Oct. 21, 2006 to Oct. 24, 2006
ISSN: 0272-5428
ISBN: 0-7695-2720-5
TABLE OF CONTENTS
Session 6A

Improved bounds for online routing and packing via a primal-dual approach (Abstract)

N. Buchbinder , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa
pp. 293-304

Foreword (PDF)

pp. xi

Reviewers (PDF)

pp. xiii-xiv

Statistical Zero-Knowledge Arguments for NP from Any One-Way Function (Abstract)

Minh-huyen Nguyen , Harvard University, USA
Shien Jin Ong , Harvard University, USA
Salil Vadhan , Harvard University, USA
pp. 3-14
Introduction

Foreword (PDF)

pp. xi

Reviewers (PDF)

pp. xiii-xiv

Improved Approximation Algorithms for Large Matrices via Random Projections (Abstract)

Tamas Sarlos , EÖtvÖs University and Computer and Automation Research Institute, Hungary
pp. 143-152
Session 1B

Heat Flow and a Faster Algorithm to Compute the Surface Area of a Convex Body (Abstract)

Mikhail Belkin , Ohio State University, USA
Hariharan Narayanan , University of Chicago, USA
Partha Niyogi , University of Chicago, USA
pp. 47-56

Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification (Abstract)

Russell Impagliazzo , University of California, San Diego, USA
Ragesh Jaiswal , University of California, San Diego, USA
Valentine Kabanets , Simon Fraser University, Canada
pp. 187-196
Session 2A

A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks (Abstract)

Tomas Feder , Stanford University, USA
Adam Guetz , Stanford University, USA
Milena Mihail , Georgia Tech, USA
Amin Saberi , Stanford University, USA
pp. 69-76

Strategic Network Formation through Peering and Service Agreements (Abstract)

Elliot Anshelevich , Princeton University, USA
Bruce Shepherd , Bell Labs, USA
Gordon Wilfong , Bell Labs, USA
pp. 77-86

SDP gaps and UGC-hardness for MAXCUTGAIN (Abstract)

Subhash Khot , Georgia Tech, USA
Ryan O'Donnell , Microsoft Research
pp. 217-226
Session 2B

Lp metrics on the Heisenberg group and the Goemans-Linial conjecture (Abstract)

James R. Lee , Institute for Advanced Study, USA
Assaf Naor , Microsoft Research
pp. 99-108

Ramsey partitions and proximity data structures (Abstract)

Manor Mendel , The Open University of Israel
Assaf Naor , Microsoft Research
pp. 109-118

Algorithms on negatively curved spaces (Abstract)

Robert Krauthgamer , IBM Almaden, USA
James R. Lee , Institute for Advanced Study, USA
pp. 119-132
Session 3A

Improved Approximation Algorithms for Large Matrices via Random Projections (Abstract)

Tam?s Sarl? , E?tv?s University and Computer and Automation Research Institute, Hungary
pp. 143-152

The Effectiveness of Lloyd-Type Methods for the k-Means Problem (Abstract)

Rafail Ostrovsky , UCLA, USA
Yuval Rabani , Israel Institute of Technology, Israel
Leonard J. Schulman , Caltech, USA
Chaitanya Swamy , Caltech, USA
pp. 165-176
Session 3B

Better lossless condensers through derandomized curve samplers (Abstract)

Amnon Ta-Shma , Tel-Aviv University, Israel
Christopher Umans , California Institute of Technology, USA
pp. 177-186

Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification (Abstract)

Russell Impagliazzo , University of California, San Diego, USA
Ragesh Jaiswal , University of California, San Diego, USA
Valentine Kabanets , Simon Fraser University, Canada
pp. 187-196
Session 3B

Subspace Polynomials and List Decoding of Reed-Solomon Codes (Abstract)

Eli Ben-Sasson , Technion, Israel
Swastik Kopparty , MIT, USA
Jaikumar Radhakrishnan , Tata Insitute of Fundamental Research, India; Toyota Technological Institute, USA
pp. 207-216

Concurrent Non-Malleable Zero Knowledge (Abstract)

Boaz Barak , Princeton University, USA
Manoj Prabhakaran , University of Illinois at Urbana-Champaign, USA
Amit Sahai , University of California Los Angeles, USA
pp. 345-354

Succinct Non-Interactive Zero-Knowledge Proofs with Preprocessing for LOGSNP (Abstract)

Yael Tauman Kalai , M.I.T, USA
Ran Raz , Weizmann Institute of Science, Israel
pp. 355-366
Session 4B

Cryptography from Anonymity (Abstract)

Yuval Ishai , Technion, Israel
Eyal Kushilevitz , Technion, Israel
Rafail Ostrovsky , UCLA, USA
Amit Sahai , UCLA, USA
pp. 239-248

Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority (Abstract)

Michael Ben-Or , The Hebrew University, Israel
Claude Crepeau , McGill University, Canada
Daniel Gottesman , Perimeter Institute for Theoretical Physics, Canada
Avinatan Hassidim , The Hebrew University, Israel
Adam Smith , Weizmann Institute of Science, Israel
pp. 249-260
Session 5A

Settling the Complexity of Two-Player Nash Equilibrium (Abstract)

Xi Chen , Tsinghua University, China
Xiaotie Deng , City University of Hong Kong, Hong Kong, China
pp. 261-272
Session 6A

Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs (Abstract)

Tamas Kiraly , Eotvos Lorand University, Hungary
Lap Chi Lau , University of Toronto, Canada
pp. 283-292

On the Quantum Query Complexity of Local Search in Two and Three Dimensions (Abstract)

Xiaoming Sun , Tsinghua University, China
Andrew C. Yao , Tsinghua University, China
pp. 429-438
Session 6B

Coresets forWeighted Facilities and Their Applications (Abstract)

Dan Feldman , Tel Aviv University, Israel
Amos Fiat , Tel Aviv University, Israel
Micha Sharir , Tel Aviv University, Israel
pp. 315-324

Points on Computable Curves (Abstract)

Xiaoyang Gu , Iowa State University, USA
Jack H. Lutz , Iowa State University, USA
Elvira Mayordomo , Universidad de Zaragoza, Spain
pp. 469-474
Session 7A

Succinct Non-Interactive Zero-Knowledge Proofs with Preprocessing for LOGSNP (Abstract)

Yael Tauman Kalai , M.I.T, USA
Ran Raz , Weizmann Institute of Science, Israel
pp. 355-366

Norm of the inverse of a random matrix (Abstract)

Mark Rudelson , University of Missouri, USA
pp. 487-496
Session 7B

Accidental Algorthims (Abstract)

Leslie G. Valiant , Harvard University, USA
pp. 509-517
Session 7B

Solving Evacuation Problems Efficiently--Earliest Arrival Flows with Multiple Sources (Abstract)

Nadine Baumann , Universitat Dortmund, Germany
Martin Skutella , Universitat Dortmund, Germany
pp. 399-410
Session 8A

New Limits on Fault-Tolerant Quantum Computation (Abstract)

Harry Buhrman , CWI and U of Amsterdam, Netherlands
Richard Cleve , U of Waterloo and Perimeter Institute, Canada
Monique Laurent , CWI, Amsterdam, Netherlands
Noah Linden , U of Bristol, UK
Alexander Schrijver , CWI and U of Amsterdam, Netherlands
Falk Unger , CWI, Amsterdam, Netherlands
pp. 411-419

Postselection threshold against biased noise (Abstract)

Ben W. Reichardt , University of California Berkeley, USA
pp. 420-428

On the Quantum Query Complexity of Local Search in Two and Three Dimensions (Abstract)

Xiaoming Sun , Tsinghua University, China
Andrew C. Yao , Tsinghua University, China
pp. 429-438

On the time complexity of 2-tag systems and small universal Turing machines (Abstract)

Damien Woods , University College Cork, Ireland
Turlough Neary , National University of Ireland, Ireland
pp. 439-448

Inclusion--Exclusion Algorithms for Counting Set Partitions (Abstract)

Andreas Bjorklund , Lund University, Sweden
Thore Husfeldt , Lund University, Sweden
pp. 575-582

Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths (Abstract)

Surender Baswana , Indian Institute of Technology, India
Telikepalli Kavitha , Indian Institute of Science, India
pp. 591-602
Session 8B

Local Graph Partitioning using PageRank Vectors (Abstract)

Reid Andersen , University of California, San Diego, USA
Fan Chung , University of California, San Diego, USA
Kevin Lang , Yahoo! Research, USA
pp. 475-486

On the Impact of Combinatorial Structure on Congestion Games (Abstract)

Heiner Ackermann , RWTH Aachen, Germany
Heiko Roglin , RWTH Aachen, Germany
Berthold Vocking , RWTH Aachen, Germany
pp. 613-622
Session 9A

Witnesses for non-satisfiability of dense random 3CNF formulas (Abstract)

Uriel Feige , Microsoft Research and Weizmann Institute
Jeong Han Kim , Microsoft Research, USA
Eran Ofek , Weizmann Institute, Israel
pp. 497-508

On a Geometric Generalization of the Upper Bound Theorem (Abstract)

Uli Wagner , The Hebrew University of Jerusalem, Israel; Institut für Theoretische Informatik, Switzerland
pp. 635-645
Session 9B

The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels (Abstract)

Christian Borgs , Microsoft Research
Jennifer Chayes , Microsoft Research
Elchanan Mossel , UC Berkeley, USA
Sebastien Roch , UC Berkeley, USA
pp. 518-530
Session 10A

Algebraic Structures and Algorithms for Matching and Matroid Problems (Abstract)

Nicholas J. A. Harvey , Massachusetts Institute of Technology, USA
pp. 531-542
Session 11A

Hardness of Learning Halfspaces with Noise (Abstract)

Venkatesan Guruswami , University of Washington, USA
Prasad Raghavendra , University of Washington, USA
pp. 543-552

Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design (Abstract)

C. Chekuri , University of Illinois, USA
M. T. Hajiaghayi , Carnegie Mellon University
G. Kortsarz , Rutgers University-Camden
M. R. Salavatipour , University of Alberta, Canada
pp. 677-686
Session 11A

New Results for Learning Noisy Parities and Halfspaces (Abstract)

Vitaly Feldman , Harvard University, USA
Parikshit Gopalan , Georgia Tech., USA
Subhash Khot , Georgia Tech., USA
Ashok Kumar Ponnuswami , Georgia Tech., USA
pp. 563-574
Session 11B

Inclusion--Exclusion Algorithms for Counting Set Partitions (Abstract)

Andreas Bjorklund , Lund University, Sweden
Thore Husfeldt , Lund University, Sweden
pp. 575-582

On the Compressibility of NP Instances and Cryptographic Applications (Abstract)

Danny Harnik , Technion, Israel
Moni Naor , Weizmann Institute of Science, Israel
pp. 719-728
Session 12A

Computing Nash Equilibria: Approximation and Smoothed Complexity (Abstract)

Xi Chen , Tsinghua University, China
Xiaotie Deng , City University of Hong Kong, Hong Kong China
Shang-Hua Teng , Boston University and Akamai, USA
pp. 603-612
Session 12A

Balanced Allocations of Cake (Abstract)

Jeff Edmonds , York University, Canada
Kirk Pruhs , University of Pittsburgh, USA
pp. 623-634
Session 12B

On a Geometric Generalization of the Upper Bound Theorem (Abstract)

Uli Wagner , The Hebrew University of Jerusalem, Israel; Institut f?r Theoretische Informatik, Switzerland
pp. 635-645

Planar Earthmover is not in L_1 (Abstract)

Assaf Naor , Microsoft Research
Gideon Schechtman , Weizmann Institute, Israel
pp. 655-666
Session 13A

Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e (Abstract)

Uriel Feige , Microsoft Research, USA
Jan Vondrak , Princeton University, USA
pp. 667-676

Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design (Abstract)

C. Chekuri , University of Illinois, USA
M. T. Hajiaghayi , Carnegie Mellon University
G. Kortsarz , Rutgers University-Camden
M. R. Salavatipour , University of Alberta, Canada
pp. 677-686

How to Play Unique Games Using Embeddings (Abstract)

Eden Chlamtac , Princeton University, USA
Konstantin Makarychev , Princeton University, USA
Yury Makarychev , Princeton University, USA
pp. 687-696

Improved approximation algorithms for multidimensional bin packing problems (Abstract)

Nikhil Bansal , IBM T.J. Watson Research Center, USA
Alberto Caprara , DEIS, University of Bologna, Italy
Maxim Sviridenko , IBM T.J. Watson Research Center, USA
pp. 697-708
Session 13B

Lower bounds for circuits with MOD_m gates (Abstract)

Arkadev Chattopadhyay , McGill University, Canada
Navin Goyal , McGill University, Canada
Pavel Pudlak , Czech Academy of Sciences, Czech Republic
Denis Therien , McGill University, Canada
pp. 709-718

On the Compressibility of NP Instances and Cryptographic Applications (Abstract)

Danny Harnik , Technion, Israel
Moni Naor , Weizmann Institute of Science, Israel
pp. 719-728
Author Index

Author Index (PDF)

pp. 749-750
90 ms
(Ver 3.3 (11022016))