Table of Contents

• Statistical Zero-Knowledge Arguments for NP from Any One-Way FunctionMinh-Huyen Nguyen, Shien Jin Ong, Salil P. Vadhan. 3-14 [doi]
• Fault-Tolerant Distributed Computing in Full-Information NetworksShafi Goldwasser, Elan Pavlov, Vinod Vaikuntanathan. 15-26 [doi]
• Explicit Exclusive Set Systems with Applications to Broadcast EncryptionCraig Gentry, Zulfikar Ramzan, David P. Woodruff. 27-38 [doi]
• A simple condition implying rapid mixing of single-site dynamics on spin systemsThomas P. Hayes. 39-46 [doi]
• Heat Flow and a Faster Algorithm to Compute the Surface Area of a Convex BodyMikhail Belkin, Hariharan Narayanan, Partha Niyogi. 47-56 [doi]
• Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and OptimizationLászló Lovász, Santosh Vempala. 57-68 [doi]
• A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer NetworksTomás Feder, Adam Guetz, Milena Mihail, Amin Saberi. 69-76 [doi]
• Strategic Network Formation through Peering and Service AgreementsElliot Anshelevich, F. Bruce Shepherd, Gordon T. Wilfong. 77-86 [doi]
• Towards Secure and Scalable Computation in Peer-to-Peer NetworksValerie King, Jared Saia, Vishal Sanwalani, Erik Vee. 87-98 [doi]
• Lp metrics on the Heisenberg group and the Goemans-Linial conjectureJames R. Lee, Assaf Naor. 99-108 [doi]
• Ramsey partitions and proximity data structuresManor Mendel, Assaf Naor. 109-118 [doi]
• Algorithms on negatively curved spacesRobert Krauthgamer, James R. Lee. 119-132 [doi]
• Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex MethodRoman Vershynin. 133-142 [doi]
• Improved Approximation Algorithms for Large Matrices via Random ProjectionsTamás Sarlós. 143-152 [doi]
• Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means MethodDavid Arthur, Sergei Vassilvitskii. 153-164 [doi]
• The Effectiveness of Lloyd-Type Methods for the k-Means ProblemRafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy. 165-176 [doi]
• Better lossless condensers through derandomized curve samplersAmnon Ta-Shma, Christopher Umans. 177-186 [doi]
• Approximately List-Decoding Direct Product Codes and Uniform Hardness AmplificationRussell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets. 187-196 [doi]
• Index Coding with Side InformationZiv Bar-Yossef, Yitzhak Birk, T. S. Jayram, Tomer Kol. 197-206 [doi]
• Subspace Polynomials and List Decoding of Reed-Solomon CodesEli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan. 207-216 [doi]
• SDP gaps and UGC-hardness for MAXCUTGAINSubhash Khot, Ryan O Donnell. 217-226 [doi]
• Correlated Algebraic-Geometric Codes: Improved List Decoding over Bounded AlphabetsVenkatesan Guruswami, Anindya C. Patthak. 227-238 [doi]
• Cryptography from AnonymityYuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai. 239-248 [doi]
• Secure Multiparty Quantum Computation with (Only) a Strict Honest MajorityMichael Ben-Or, Claude Crépeau, Daniel Gottesman, Avinatan Hassidim, Adam Smith. 249-260 [doi]
• Settling the Complexity of Two-Player Nash EquilibriumXi Chen, Xiaotie Deng. 261-272 [doi]
• Minimum Bounded Degree Spanning TreesMichel X. Goemans. 273-282 [doi]
• Approximate Min-Max Theorems of Steiner Rooted-Orientations of HypergraphsTamás Király, Lap Chi Lau. 283-292 [doi]
• Improved Bounds for Online Routing and Packing Via a Primal-Dual ApproachNiv Buchbinder, Joseph Naor. 293-304 [doi]
• Improved Dynamic Planar Point LocationLars Arge, Gerth Stølting Brodal, Loukas Georgiadis. 305-314 [doi]
• Coresets forWeighted Facilities and Their ApplicationsDan Feldman, Amos Fiat, Micha Sharir. 315-324 [doi]
• Planar Point Location in Sublogarithmic TimeMihai Patrascu. 325-332 [doi]
• Point Location in o(log n) Time, Voronoi Diagrams in o(n log n) Time, and Other Transdichotomous Results in Computational GeometryTimothy M. Chan. 333-344 [doi]
• Concurrent Non-Malleable Zero KnowledgeBoaz Barak, Manoj Prabhakaran, Amit Sahai. 345-354 [doi]
• Succinct Non-Interactive Zero-Knowledge Proofs with Preprocessing for LOGSNPYael Tauman Kalai, Ran Raz. 355-366 [doi]
• Input-Indistinguishable ComputationSilvio Micali, Rafael Pass, Alon Rosen. 367-378 [doi]
• Generalization of Binary Search: Searching in Trees and Forest-Like Partial OrdersKrzysztof Onak, Pawel Parys. 379-388 [doi]
• Lower Bounds for Additive Spanners, Emulators, and MoreDavid P. Woodruff. 389-398 [doi]
• Solving Evacuation Problems Efficiently--Earliest Arrival Flows with Multiple SourcesNadine Baumann, Martin Skutella. 399-410 [doi]
• New Limits on Fault-Tolerant Quantum ComputationHarry Buhrman, Richard Cleve, Monique Laurent, Noah Linden, Alexander Schrijver, Falk Unger. 411-419 [doi]
• Postselection threshold against biased noiseBen Reichardt. 420-428 [doi]
• On the Quantum Query Complexity of Local Search in Two and Three DimensionsXiaoming Sun, Andrew Chi-Chih Yao. 429-438 [doi]
• On the time complexity of 2-tag systems and small universal Turing machinesDamien Woods, Turlough Neary. 439-448 [doi]
• On the Optimality of the Dimensionality Reduction MethodAlexandr Andoni, Piotr Indyk, Mihai Patrascu. 449-458 [doi]
• Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High DimensionsAlexandr Andoni, Piotr Indyk. 459-468 [doi]
• Points on Computable CurvesXiaoyang Gu, Jack H. Lutz, Elvira Mayordomo. 469-474 [doi]
• Local Graph Partitioning using PageRank VectorsReid Andersen, Fan R. K. Chung, Kevin J. Lang. 475-486 [doi]
• Norm of the inverse of a random matrixMark Rudelson. 487-496 [doi]
• Witnesses for non-satisfiability of dense random 3CNF formulasUriel Feige, Jeong Han Kim, Eran Ofek. 497-508 [doi]
• Accidental AlgorthimsLeslie G. Valiant. 509-517 [doi]
• The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary ChannelsChristian Borgs, Jennifer T. Chayes, Elchanan Mossel, Sébastien Roch. 518-530 [doi]
• Algebraic Structures and Algorithms for Matching and Matroid ProblemsNicholas J. A. Harvey. 531-542 [doi]
• Hardness of Learning Halfspaces with NoiseVenkatesan Guruswami, Prasad Raghavendra. 543-552 [doi]
• Cryptographic Hardness for Learning Intersections of HalfspacesAdam R. Klivans, Alexander A. Sherstov. 553-562 [doi]
• New Results for Learning Noisy Parities and HalfspacesVitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami. 563-574 [doi]
• Inclusion--Exclusion Algorithms for Counting Set PartitionsAndreas Björklund, Thore Husfeldt. 575-582 [doi]
• An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--ExclusionMikko Koivisto. 583-590 [doi]
• Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch PathsSurender Baswana, Telikepalli Kavitha. 591-602 [doi]
• Computing Nash Equilibria: Approximation and Smoothed ComplexityXi Chen, Xiaotie Deng, Shang-Hua Teng. 603-612 [doi]
• On the Impact of Combinatorial Structure on Congestion GamesHeiner Ackermann, Heiko Röglin, Berthold Vöcking. 613-622 [doi]
• Balanced Allocations of CakeJeff Edmonds, Kirk Pruhs. 623-634 [doi]
• On a Geometric Generalization of the Upper Bound TheoremUli Wagner. 635-645 [doi]
• Higher Lower Bounds for Near-Neighbor and Further Rich ProblemsMihai Patrascu, Mikkel Thorup. 646-654 [doi]
• Planar Earthmover is not in L_1Assaf Naor, Gideon Schechtman. 655-666 [doi]
• Approximation algorithms for allocation problems: Improving the factor of 1 - 1/eUriel Feige, Jan Vondrák. 667-676 [doi]
• Approximation Algorithms for Non-Uniform Buy-at-Bulk Network DesignChandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour. 677-686 [doi]
• How to Play Unique Games Using EmbeddingsEden Chlamtac, Konstantin Makarychev, Yury Makarychev. 687-696 [doi]
• Improved approximation algorithms for multidimensional bin packing problemsNikhil Bansal, Alberto Caprara, Maxim Sviridenko. 697-708 [doi]
• Lower bounds for circuits with MOD_m gatesArkadev Chattopadhyay, Navin Goyal, Pavel Pudlák, Denis Thérien. 709-718 [doi]
• On the Compressibility of NP Instances and Cryptographic ApplicationsDanny Harnik, Moni Naor. 719-728 [doi]
• Dispersion of Mass and the Complexity of Randomized Geometric AlgorithmsLuis Rademacher, Santosh Vempala. 729-738 [doi]
• An Omega(n:::1/3:::) Lower Bound for Bilinear Group Based Private Information RetrievalAlexander A. Razborov, Sergey Yekhanin. 739-748 [doi]