1. Home
  2. Proceedings
  3. FOCS
  4. FOCS 2006
Default Cover Image

2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)

Oct. 21 2006 to Oct. 24 2006

Berkeley, CA

Table of Contents

Session 6A
Improved bounds for online routing and packing via a primal-dual approachFull-text access may be available. Sign in or learn about subscription options.pp. 293-304
by N. Buchbinder, J.S. Naor
47th Annual IEEE Symposium on Foundations of Computer Science-TitleFreely available from IEEE.
47th Annual IEEE Symposium on Foundations of Computer Science-CopyrightFreely available from IEEE.
47th Annual IEEE Symposium on Foundations of Computer Science - TOCFreely available from IEEE.
Fault-Tolerant Distributed Computing in Full-Information NetworksFull-text access may be available. Sign in or learn about subscription options.pp. 15-26
by Shafi Goldwasser, Elan Pavlov, Vinod Vaikuntanathan
Explicit Exclusive Set Systems with Applications to Broadcast EncryptionFull-text access may be available. Sign in or learn about subscription options.pp. 27-38
by Craig Gentry, Zulfikar Ramzan, David P. Woodruff
Introduction
ForewordFreely available from IEEE.
Introduction
Organizing CommitteesFreely available from IEEE.pp. xii
Introduction
ReviewersFreely available from IEEE.
Session 1A
Statistical Zero-Knowledge Arguments for NP from Any One-Way FunctionFull-text access may be available. Sign in or learn about subscription options.pp. 3-14
by Minh-huyen Nguyen, Shien Jin Ong, Salil Vadhan
Session 1B
A simple condition implying rapid mixing of single-site dynamics on spin systemsFull-text access may be available. Sign in or learn about subscription options.pp. 39-46
by Thomas P. Hayes
Session 1B
Heat Flow and a Faster Algorithm to Compute the Surface Area of a Convex BodyFull-text access may be available. Sign in or learn about subscription options.pp. 47-56
by Mikhail Belkin, Hariharan Narayanan, Partha Niyogi
Session 1B
Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and OptimizationFull-text access may be available. Sign in or learn about subscription options.pp. 57-68
by Laszlo Lovasz, Santosh Vempala
Session 2A
A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer NetworksFull-text access may be available. Sign in or learn about subscription options.pp. 69-76
by Tomas Feder, Adam Guetz, Milena Mihail, Amin Saberi
Session 2A
Strategic Network Formation through Peering and Service AgreementsFull-text access may be available. Sign in or learn about subscription options.pp. 77-86
by Elliot Anshelevich, Bruce Shepherd, Gordon Wilfong
Session 2A
Towards Secure and Scalable Computation in Peer-to-Peer NetworksFull-text access may be available. Sign in or learn about subscription options.pp. 87-98
by Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee
Session 2B
Lp metrics on the Heisenberg group and the Goemans-Linial conjectureFull-text access may be available. Sign in or learn about subscription options.pp. 99-108
by James R. Lee, Assaf Naor
Session 2B
Ramsey partitions and proximity data structuresFull-text access may be available. Sign in or learn about subscription options.pp. 109-118
by Manor Mendel, Assaf Naor
Session 2B
Algorithms on negatively curved spacesFull-text access may be available. Sign in or learn about subscription options.pp. 119-132
by Robert Krauthgamer, James R. Lee
Session 3A
Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex MethodFull-text access may be available. Sign in or learn about subscription options.pp. 133-142
by Roman Vershynin
Session 3A
Improved Approximation Algorithms for Large Matrices via Random ProjectionsFull-text access may be available. Sign in or learn about subscription options.pp. 143-152
by Tamas Sarlos
Session 3A
Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means MethodFull-text access may be available. Sign in or learn about subscription options.pp. 153-164
by David Arthur, Sergei Vassilvitskii
Session 3A
The Effectiveness of Lloyd-Type Methods for the k-Means ProblemFull-text access may be available. Sign in or learn about subscription options.pp. 165-176
by Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy
Session 3B
Better lossless condensers through derandomized curve samplersFull-text access may be available. Sign in or learn about subscription options.pp. 177-186
by Amnon Ta-Shma, Christopher Umans
Session 3B
Approximately List-Decoding Direct Product Codes and Uniform Hardness AmplificationFull-text access may be available. Sign in or learn about subscription options.pp. 187-196
by Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets
Session 3B
Index Coding with Side InformationFull-text access may be available. Sign in or learn about subscription options.pp. 197-206
by Ziv Bar-Yossef, Yitzhak Birk, T. S. Jayram, Tomer Kol
Session 3B
Subspace Polynomials and List Decoding of Reed-Solomon CodesFull-text access may be available. Sign in or learn about subscription options.pp. 207-216
by Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan
Session 4A
SDP gaps and UGC-hardness for MAXCUTGAINFull-text access may be available. Sign in or learn about subscription options.pp. 217-226
by Subhash Khot, Ryan O'Donnell
Session 4A
Correlated Algebraic-Geometric Codes: Improved List Decoding over Bounded AlphabetsFull-text access may be available. Sign in or learn about subscription options.pp. 227-238
by Venkatesan Guruswami, Anindya C. Patthak
Session 4B
Cryptography from AnonymityFull-text access may be available. Sign in or learn about subscription options.pp. 239-248
by Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai
Session 4B
Secure Multiparty Quantum Computation with (Only) a Strict Honest MajorityFull-text access may be available. Sign in or learn about subscription options.pp. 249-260
by Michael Ben-Or, Claude Crepeau, Daniel Gottesman, Avinatan Hassidim, Adam Smith
Session 5A
Settling the Complexity of Two-Player Nash EquilibriumFull-text access may be available. Sign in or learn about subscription options.pp. 261-272
by Xi Chen, Xiaotie Deng
Session 6A
Minimum Bounded Degree Spanning TreesFull-text access may be available. Sign in or learn about subscription options.pp. 273-282
by Michel X. Goemans
Session 6A
Approximate Min-Max Theorems of Steiner Rooted-Orientations of HypergraphsFull-text access may be available. Sign in or learn about subscription options.pp. 283-292
by Tamas Kiraly, Lap Chi Lau
Session 6B
Improved Dynamic Planar Point LocationFull-text access may be available. Sign in or learn about subscription options.pp. 305-314
by Lars Arge, Gerth St?lting Brodal, Loukas Georgiadis
Session 6B
Coresets forWeighted Facilities and Their ApplicationsFull-text access may be available. Sign in or learn about subscription options.pp. 315-324
by Dan Feldman, Amos Fiat, Micha Sharir
Session 6B
Planar Point Location in Sublogarithmic TimeFull-text access may be available. Sign in or learn about subscription options.pp. 325-332
by Mihai Patrascu
Session 6B
Point Location in o(log n) Time, Voronoi Diagrams in o(n log n) Time, and Other Transdichotomous Results in Computational GeometryFull-text access may be available. Sign in or learn about subscription options.pp. 333-344
by Timothy M. Chan
Session 7A
Concurrent Non-Malleable Zero KnowledgeFull-text access may be available. Sign in or learn about subscription options.pp. 345-354
by Boaz Barak, Manoj Prabhakaran, Amit Sahai
Session 7A
Succinct Non-Interactive Zero-Knowledge Proofs with Preprocessing for LOGSNPFull-text access may be available. Sign in or learn about subscription options.pp. 355-366
by Yael Tauman Kalai, Ran Raz
Session 7A
Input-Indistinguishable ComputationFull-text access may be available. Sign in or learn about subscription options.pp. 367-378
by Silvio Micali, Rafael Pass, Alon Rosen
Session 7B
Generalization of Binary Search: Searching in Trees and Forest-Like Partial OrdersFull-text access may be available. Sign in or learn about subscription options.pp. 379-388
by Krzysztof Onak, Pawel Parys
Session 7B
Lower Bounds for Additive Spanners, Emulators, and MoreFull-text access may be available. Sign in or learn about subscription options.pp. 389-398
by David P. Woodruff
Session 7B
Solving Evacuation Problems Efficiently--Earliest Arrival Flows with Multiple SourcesFull-text access may be available. Sign in or learn about subscription options.pp. 399-410
by Nadine Baumann, Martin Skutella
Session 8A
New Limits on Fault-Tolerant Quantum ComputationFull-text access may be available. Sign in or learn about subscription options.pp. 411-419
by Harry Buhrman, Richard Cleve, Monique Laurent, Noah Linden, Alexander Schrijver, Falk Unger
Session 8A
Postselection threshold against biased noiseFull-text access may be available. Sign in or learn about subscription options.pp. 420-428
by Ben W. Reichardt
Session 8A
On the Quantum Query Complexity of Local Search in Two and Three DimensionsFull-text access may be available. Sign in or learn about subscription options.pp. 429-438
by Xiaoming Sun, Andrew C. Yao
Session 8A
On the time complexity of 2-tag systems and small universal Turing machinesFull-text access may be available. Sign in or learn about subscription options.pp. 439-448
by Damien Woods, Turlough Neary
Session 8B
On the Optimality of the Dimensionality Reduction MethodFull-text access may be available. Sign in or learn about subscription options.pp. 449-458
by Alexandr Andoni, Piotr Indyk, Mihai Patrascu
Session 8B
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High DimensionsFull-text access may be available. Sign in or learn about subscription options.pp. 459-468
by Alexandr Andoni, Piotr Indyk
Session 8B
Points on Computable CurvesFull-text access may be available. Sign in or learn about subscription options.pp. 469-474
by Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo
Session 8B
Local Graph Partitioning using PageRank VectorsFull-text access may be available. Sign in or learn about subscription options.pp. 475-486
by Reid Andersen, Fan Chung, Kevin Lang
Session 9A
Norm of the inverse of a random matrixFull-text access may be available. Sign in or learn about subscription options.pp. 487-496
by Mark Rudelson
Session 9A
Witnesses for non-satisfiability of dense random 3CNF formulasFull-text access may be available. Sign in or learn about subscription options.pp. 497-508
by Uriel Feige, Jeong Han Kim, Eran Ofek
Session 9B
Accidental AlgorthimsFull-text access may be available. Sign in or learn about subscription options.pp. 509-517
by Leslie G. Valiant
Session 9B
The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary ChannelsFull-text access may be available. Sign in or learn about subscription options.pp. 518-530
by Christian Borgs, Jennifer Chayes, Elchanan Mossel, Sebastien Roch
Session 10A
Algebraic Structures and Algorithms for Matching and Matroid ProblemsFull-text access may be available. Sign in or learn about subscription options.pp. 531-542
by Nicholas J. A. Harvey
Session 11A
Hardness of Learning Halfspaces with NoiseFull-text access may be available. Sign in or learn about subscription options.pp. 543-552
by Venkatesan Guruswami, Prasad Raghavendra
Session 11A
Cryptographic Hardness for Learning Intersections of HalfspacesFull-text access may be available. Sign in or learn about subscription options.pp. 553-562
by Adam R. Klivans, Alexander A. Sherstov
Session 11A
New Results for Learning Noisy Parities and HalfspacesFull-text access may be available. Sign in or learn about subscription options.pp. 563-574
by Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami
Session 11B
Inclusion--Exclusion Algorithms for Counting Set PartitionsFull-text access may be available. Sign in or learn about subscription options.pp. 575-582
by Andreas Bjorklund, Thore Husfeldt
Session 11B
An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--ExclusionFull-text access may be available. Sign in or learn about subscription options.pp. 583-590
by Mikko Koivisto
Session 11B
Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch PathsFull-text access may be available. Sign in or learn about subscription options.pp. 591-602
by Surender Baswana, Telikepalli Kavitha
Session 12A
Computing Nash Equilibria: Approximation and Smoothed ComplexityFull-text access may be available. Sign in or learn about subscription options.pp. 603-612
by Xi Chen, Xiaotie Deng, Shang-Hua Teng
Session 12A
On the Impact of Combinatorial Structure on Congestion GamesFull-text access may be available. Sign in or learn about subscription options.pp. 613-622
by Heiner Ackermann, Heiko Roglin, Berthold Vocking
Session 12A
Balanced Allocations of CakeFull-text access may be available. Sign in or learn about subscription options.pp. 623-634
by Jeff Edmonds, Kirk Pruhs
Session 12B
On a Geometric Generalization of the Upper Bound TheoremFull-text access may be available. Sign in or learn about subscription options.pp. 635-645
by Uli Wagner
Session 12B
Higher Lower Bounds for Near-Neighbor and Further Rich ProblemsFull-text access may be available. Sign in or learn about subscription options.pp. 646-654
by Mihai Patrascu, Mikkel Thorup
Session 12B
Planar Earthmover is not in L_1Full-text access may be available. Sign in or learn about subscription options.pp. 655-666
by Assaf Naor, Gideon Schechtman
Session 13A
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/eFull-text access may be available. Sign in or learn about subscription options.pp. 667-676
by Uriel Feige, Jan Vondrak
Session 13A
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network DesignFull-text access may be available. Sign in or learn about subscription options.pp. 677-686
by C. Chekuri, M. T. Hajiaghayi, G. Kortsarz, M. R. Salavatipour
Session 13A
How to Play Unique Games Using EmbeddingsFull-text access may be available. Sign in or learn about subscription options.pp. 687-696
by Eden Chlamtac, Konstantin Makarychev, Yury Makarychev
Session 13A
Improved approximation algorithms for multidimensional bin packing problemsFull-text access may be available. Sign in or learn about subscription options.pp. 697-708
by Nikhil Bansal, Alberto Caprara, Maxim Sviridenko
Session 13B
Lower bounds for circuits with MOD_m gatesFull-text access may be available. Sign in or learn about subscription options.pp. 709-718
by Arkadev Chattopadhyay, Navin Goyal, Pavel Pudlak, Denis Therien
Session 13B
On the Compressibility of NP Instances and Cryptographic ApplicationsFull-text access may be available. Sign in or learn about subscription options.pp. 719-728
by Danny Harnik, Moni Naor
Session 13B
Dispersion of Mass and the Complexity of Randomized Geometric AlgorithmsFull-text access may be available. Sign in or learn about subscription options.pp. 729-738
by Luis Rademacher, Santosh Vempala
Session 13B
An \Omega(n^1/3 ) Lower Bound for Bilinear Group Based Private Information RetrievalFull-text access may be available. Sign in or learn about subscription options.pp. 739-748
by Alexander A. Razborov, Sergey Yekhanin
Author Index
Author IndexFreely available from IEEE.pp. 749-750
Showing 78 out of 78