Table of Contents

• The Polynomial Method in Quantum and Classical ComputingScott Aaronson. 3 [doi]
• Theory of Sponsored Search AuctionsGagan Aggarwal, S. Muthukrishnan. 7 [doi]
• Average-case ComplexityLuca Trevisan. 11 [doi]
• Truthful Approximation Schemes for Single-Parameter AgentsPeerapong Dhangwatnotai, Shahar Dobzinski, Shaddin Dughmi, Tim Roughgarden. 15-24 [doi]
• Discretized Multinomial Distributions and Nash Equilibria in Anonymous GamesConstantinos Daskalakis, Christos H. Papadimitriou. 25-34 [doi]
• Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited SupplyMaurice Cheung, Chaitanya Swamy. 35-44 [doi]
• Market Equilibria in Polynomial Time for Fixed Number of Goods or AgentsNikhil R. Devanur, Ravi Kannan. 45-53 [doi]
• The Sign-Rank of AC^OAlexander A. Razborov, Alexander A. Sherstov. 57-66 [doi]
• Arithmetic Circuits: A Chasm at Depth FourManindra Agrawal, V. Vinay. 67-75 [doi]
• Dense Subsets of Pseudorandom SetsOmer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan. 76-85 [doi]
• Almost-Natural ProofsTimothy Y. Chow. 86-91 [doi]
• Dynamic Connectivity: Connecting to Networks and GeometryTimothy M. Chan, Mihai Patrascu, Liam Roditty. 95-104 [doi]
• Algorithms for Single-Source Vertex ConnectivityJulia Chuzhoy, Sanjeev Khanna. 105-114 [doi]
• A Polynomial-Time Approximation Scheme for Euclidean Steiner ForestGlencora Borradaile, Philip N. Klein, Claire Mathieu. 115-124 [doi]
• Degree Bounded Network Design with Metric CostsYuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Kong Yung. 125-134 [doi]
• Matrix Sparsification for Rank and Determinant Computations via Nested DissectionRaphael Yuster. 137-145 [doi]
• Fast Modular Composition in any CharacteristicKiran S. Kedlaya, Christopher Umans. 146-155 [doi]
• Gaussian Bounds for Noise Correlation of Functions and Tight Analysis of Long CodesElchanan Mossel. 156-165 [doi]
• Worst Case to Average Case Reductions for PolynomialsTali Kaufman, Shachar Lovett. 166-175 [doi]
• On the Union of Cylinders in Three DimensionsEsther Ezra. 179-188 [doi]
• Spherical Cubes and Rounding in High DimensionsGuy Kindler, Ryan O Donnell, Anup Rao, Avi Wigderson. 189-198 [doi]
• Near-Optimal Sparse Recovery in the L1 NormPiotr Indyk, Milan Ruzic. 199-207 [doi]
• On Basing Lower-Bounds for Learning on Worst-Case AssumptionsBenny Applebaum, Boaz Barak, David Xiao. 211-220 [doi]
• The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well)Michael Ben-Or, Avinatan Hassidim. 221-230 [doi]
• Hardness of Minimizing and Learning DNF ExpressionsSubhash Khot, Rishi Saket. 231-240 [doi]
• Elections Can be Manipulated OftenEhud Friedgut, Gil Kalai, Noam Nisan. 243-249 [doi]
• On the Hardness of Being TruthfulChristos H. Papadimitriou, Michael Schapira, Yaron Singer. 250-259 [doi]
• Multi-unit Auctions with Budget LimitsShahar Dobzinski, Ron Lavi, Noam Nisan. 260-269 [doi]
• Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources ExtractorsRan Raz, Amir Yehudayoff. 273-282 [doi]
• On the Impossibility of Basing Identity Based Encryption on Trapdoor PermutationsDan Boneh, Periklis A. Papakonstantinou, Charles Rackoff, Yevgeniy Vahlis, Brent Waters. 283-292 [doi]
• Leakage-Resilient CryptographyStefan Dziembowski, Krzysztof Pietrzak. 293-302 [doi]
• SuccincterMihai Patrascu. 305-313 [doi]
• Two Query PCP with Sub-Constant ErrorDana Moshkovitz, Ran Raz. 314-323 [doi]
• Constant-Time Approximation Algorithms via Local ImprovementsHuy N. Nguyen, Krzysztof Onak. 327-336 [doi]
• Some Results on Greedy Embeddings in Metric SpacesAnkur Moitra, Tom Leighton. 337-346 [doi]
• Set Covering with our Eyes ClosedFabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh. 347-356 [doi]
• Minimizing Movement in Mobile Facility Location ProblemsZachary Friggstad, Mohammad R. Salavatipour. 357-366 [doi]
• A Counterexample to Strong Parallel RepetitionRan Raz. 369-373 [doi]
• Rounding Parallel Repetitions of Unique GamesBoaz Barak, Moritz Hardt, Ishay Haviv, Anup Rao, Oded Regev, David Steurer. 374-383 [doi]
• The Unbounded-Error Communication Complexity of Symmetric FunctionsAlexander A. Sherstov. 384-393 [doi]
• Lower Bounds for Noisy Wireless Networks using Sampling AlgorithmsChinmoy Dutta, Jaikumar Radhakrishnan. 394-402 [doi]
• Inapproximability for Metric Embeddings into R^dJirí Matousek, Anastasios Sidiropoulos. 405-413 [doi]
• A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial MatchRina Panigrahy, Kunal Talwar, Udi Wieder. 414-423 [doi]
• Hardness of Nearest Neighbor under L-infinityAlexandr Andoni, Dorian Croitoru, Mihai Patrascu. 424-433 [doi]
• (Data) STRUCTURESMihai Patrascu. 434-443 [doi]
• Entangled Games are Hard to ApproximateJulia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick. 447-456 [doi]
• Unique Games with Entangled Provers are EasyJulia Kempe, Oded Regev, Ben Toner. 457-466 [doi]
• Quantum Multi Prover Interactive Proofs with Communicating ProversMichael Ben-Or, Avinatan Hassidim, Haran Pilpel. 467-476 [doi]
• A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCsAvraham Ben-Aroya, Oded Regev, Ronald de Wolf. 477-486 [doi]
• Sketching and Streaming Entropy via Approximation TheoryNicholas J. A. Harvey, Jelani Nelson, Krzysztof Onak. 489-498 [doi]
• On the Value of Multiple Read/Write Streams for Approximating Frequency MomentsPaul Beame, Dang-Trinh Huynh-Ngoc. 499-508 [doi]
• Clock Synchronization with Bounded Global and Local SkewChristoph Lenzen, Thomas Locher, Roger Wattenhofer. 509-518 [doi]
• Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean SpannersYefim Dinitz, Michael Elkin, Shay Solomon. 519-528 [doi]
• What Can We Learn Privately?Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith. 531-540 [doi]
• Learning Geometric Concepts via Gaussian Surface AreaAdam R. Klivans, Ryan O Donnell, Rocco A. Servedio. 541-550 [doi]
• Isotropic PCA and Affine-Invariant ClusteringS. Charles Brubaker, Santosh Vempala. 551-560 [doi]
• Approximate Kernel ClusteringSubhash Khot, Assaf Naor. 561-570 [doi]
• Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic SubgraphVenkatesan Guruswami, Rajsekar Manokaran, Prasad Raghavendra. 573-582 [doi]
• (Acyclic) JobShops are Hard to ApproximateMonaldo Mastrolilli, Ola Svensson. 583-592 [doi]
• Linear Level Lasserre Lower Bounds for Certain k-CSPsGrant Schoenebeck. 593-602 [doi]
• The Power of Reordering for Online Minimum Makespan SchedulingMatthias Englert, Deniz Özmen, Matthias Westermann. 603-612 [doi]
• Locally Testing Direct Product in the Low Error RangeIrit Dinur, Elazar Goldenberg. 613-622 [doi]
• Kakeya Sets, New Mergers and Old ExtractorsZeev Dvir, Avi Wigderson. 625-633 [doi]
• A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction ProblemsSiu On Chan, Michael Molloy. 634-643 [doi]
• Holographic Algorithms by Fibonacci Gates and Holographic Reductions for HardnessJin-yi Cai, Pinyan Lu, Mingji Xia. 644-653 [doi]
• Network Extractor ProtocolsYael Tauman Kalai, Xin Li, Anup Rao, David Zuckerman. 654-663 [doi]
• Isomorhism of Hypergraphs of Low Rank in Moderately Exponential TimeLászló Babai, Paolo Codenotti. 667-676 [doi]
• Computing the Tutte Polynomial in Vertex-Exponential TimeAndreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto. 677-686 [doi]
• On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAPDeeparnab Chakrabarty, Gagan Goel. 687-696 [doi]
• Submodular Approximation: Sampling-based Algorithms and Lower BoundsZoya Svitkina, Lisa Fleischer. 697-706 [doi]
• Short Proofs May Be Spacious: An Optimal Separation of Space and Length in ResolutionEli Ben-Sasson, Jakob Nordström. 709-718 [doi]
• Noise Tolerance of Expanders and Sublinear Expander ReconstructionSatyen Kale, Yuval Peres, C. Seshadhri. 719-728 [doi]
• Sequence Length Requirement of Distance-Based Phylogeny Reconstruction: Breaking the Polynomial BarrierSébastien Roch. 729-738 [doi]
• Size Bounds and Query Plans for Relational JoinsAlbert Atserias, Martin Grohe, Dániel Marx. 739-748 [doi]
• Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via FlowsPunyashloka Biswal, James R. Lee, Satish Rao. 751-760 [doi]
• Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-SumsAmit Chakrabarti, Alexander Jaffe, James R. Lee, Justin Vincent. 761-770 [doi]
• A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-WidthKen-ichi Kawarabayashi, Bojan Mohar, Bruce A. Reed. 771-780 [doi]
• Nearly Tight Low Stretch Spanning TreesIttai Abraham, Yair Bartal, Ofer Neiman. 781-790 [doi]
• Algorithmic Barriers from Phase TransitionsDimitris Achlioptas, Amin Coja-Oghlan. 793-802 [doi]
• Mixing Time of Exponential Random GraphsShankar Bhamidi, Guy Bresler, Allan Sly. 803-812 [doi]
• k-Wise Independent Random GraphsNoga Alon, Asaf Nussboim. 813-822 [doi]
• Broadcasting with Side InformationNoga Alon, Eyal Lubetzky, Uri Stav, Amit Weinstein, Avinatan Hassidim. 823-832 [doi]