Table of Contents

• Spectral methods for matrices and tensorsRavindran Kannan. 1-12 [doi]
• Are many small sets explicitly small?Michel Talagrand. 13-36 [doi]
• Perfect matchings in o(::::n:::: log ::::n::::) time in regular bipartite graphsAshish Goel, Michael Kapralov, Sanjeev Khanna. 39-46 [doi]
• Extensions and limits to vertex sparsificationFrank Thomson Leighton, Ankur Moitra. 47-56 [doi]
• Subgraph sparsification and nearly optimal ultrasparsifiersAlexandra Kolla, Yury Makarychev, Amin Saberi, Shang-Hua Teng. 57-66 [doi]
• How to compress interactive communicationBoaz Barak, Mark Braverman, Xi Chen, Anup Rao. 67-76 [doi]
• Hardness amplification in proof complexityPaul Beame, Trinh Huynh, Toniann Pitassi. 87-96 [doi]
• Load balancing and orientability thresholds for random hypergraphsPu Gao, Nicholas C. Wormald. 97-104 [doi]
• Combinatorial approach to the interpolation method and scaling limits in sparse random graphsMohsen Bayati, David Gamarnik, Prasad Tetali. 105-114 [doi]
• The maximum multiflow problems with bounded fractionalityHiroshi Hirai. 115-120 [doi]
• Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithmsAleksander Madry. 121-130 [doi]
• A full characterization of quantum adviceScott Aaronson, Andrew Drucker. 131-140 [doi]
• A quantum lovász local lemmaAndris Ambainis, Julia Kempe, Or Sattath. 151-160 [doi]
• Near-optimal extractors against quantum storageAnindya De, Thomas Vidick. 161-170 [doi]
• Public-key cryptography from different assumptionsBenny Applebaum, Boaz Barak, Avi Wigderson. 171-180 [doi]
• Oblivious RAMs without cryptogrpahic assumptionsMiklós Ajtai. 181-190 [doi]
• On the round complexity of covert computationVipul Goyal, Abhishek Jain 0002. 191-200 [doi]
• Detecting high log-densities: an ::::O::::(::::n:::::::1/4:::) approximation for densest ::::k::::-subgraphAditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, Aravindan Vijayaraghavan. 201-210 [doi]
• Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidthMohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx. 211-220 [doi]
• Optimal homologous cycles, total unimodularity, and linear programmingTamal K. Dey, Anil N. Hirani, Bala Krishnamoorthy. 221-230 [doi]
• Improving exhaustive search implies superpolynomial lower boundsRyan Williams. 231-240 [doi]
• On the complexity of circuit satisfiabilityRamamohan Paturi, Pavel Pudlák. 241-250 [doi]
• Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapsesHolger Dell, Dieter van Melkebeek. 251-260 [doi]
• Recognizing well-parenthesized expressions in the streaming modelFrédéric Magniez, Claire Mathieu, Ashwin Nayak. 261-270 [doi]
• Measuring independence of datasetsVladimir Braverman, Rafail Ostrovsky. 271-280 [doi]
• Zero-one frequency lawsVladimir Braverman, Rafail Ostrovsky. 281-290 [doi]
• Improved algorithms for computing fisher s market clearing prices: computing fisher s market clearing pricesJames B. Orlin. 291-300 [doi]
• Bayesian algorithmic mechanism designJason D. Hartline, Brendan Lucier. 301-310 [doi]
• Multi-parameter mechanism design and sequential posted pricingShuchi Chawla, Jason D. Hartline, David L. Malec, Balasubramanian Sivan. 311-320 [doi]
• Saving space by algebraizationDaniel Lokshtanov, Jesper Nederlof. 321-330 [doi]
• On the structure of cubic and quartic polynomialsElad Haramaty, Amir Shpilka. 331-340 [doi]
• A sparse Johnson: Lindenstrauss transformAnirban Dasgupta, Ravi Kumar, Tamás Sarlós. 341-350 [doi]
• A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computationsDaniele Micciancio, Panagiotis Voulgaris. 351-358 [doi]
• Sorting under partial information (without the ellipsoid algorithm)Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro. 359-368 [doi]
• Matroid matching: the power of local searchJon Lee, Maxim Sviridenko, Jan Vondrák. 369-378 [doi]
• Budget constrained auctions with heterogeneous itemsSayan Bhattacharya, Gagan Goel, Sreenivas Gollapudi, Kamesh Munagala. 379-388 [doi]
• On the searchability of small-world networks with arbitrary underlying structurePierre Fraigniaud, George Giakkoupis. 389-398 [doi]
• Almost tight bounds for rumour spreading with conductanceFlavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi. 399-408 [doi]
• On the list-decodability of random linear codesVenkatesan Guruswami, Johan Håstad, Swastik Kopparty. 409-416 [doi]
• Local list-decoding and testing of random linear codes from high errorSwastik Kopparty, Shubhangi Saraf. 417-426 [doi]
• Pseudorandom generators for polynomial threshold functionsRaghu Meka, David Zuckerman. 427-436 [doi]
• Efficiency improvements in constructing pseudorandom generators from one-way functionsIftach Haitner, Omer Reingold, Salil P. Vadhan. 437-446 [doi]
• The limits of buffering: a tight lower bound for dynamic membership in the external memory modelElad Verbin, Qin Zhang. 447-456 [doi]
• Maintaining a large matching and a small vertex coverKrzysztof Onak, Ronitt Rubinfeld. 457-464 [doi]
• Connectivity oracles for failure prone graphsRan Duan, Seth Pettie. 465-474 [doi]
• Approximate sparse recovery: optimizing time and measurementsAnna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss. 475-484 [doi]
• The HOM problem is decidableGuillem Godoy, Omer Giménez, Lander Ramos, Carme Àlvarez. 485-494 [doi]
• Complexity theory for operators in analysisAkitoshi Kawamura, Stephen Cook. 495-502 [doi]
• Solving polynomial equations in smoothed polynomial time and a near solution to smale s 17th problemPeter Bürgisser, Felipe Cucker. 503-512 [doi]
• Distributed computation in dynamic networksFabian Kuhn, Nancy A. Lynch, Rotem Oshman. 513-522 [doi]
• Bounding the average sensitivity and noise sensitivity of polynomial threshold functionsIlias Diakonikolas, Prahladh Harsha, Adam Klivans, Raghu Meka, Prasad Raghavendra, Rocco A. Servedio, Li-Yang Tan. 533-542 [doi]
• An invariance principle for polytopesPrahladh Harsha, Adam Klivans, Raghu Meka. 543-552 [doi]
• Efficiently learning mixtures of two GaussiansAdam Tauman Kalai, Ankur Moitra, Gregory Valiant. 553-562 [doi]
• Augmenting undirected node-connectivity by oneLászló A. Végh. 563-572 [doi]
• QIP = PSPACERahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous. 573-582 [doi]
• An improved LP-based approximation for steiner treeJaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoß, Laura Sanità. 583-592 [doi]
• Changing base without losing spaceYevgeniy Dodis, Mihai Patrascu, Mikkel Thorup. 593-602 [doi]
• Towards polynomial lower bounds for dynamic problemsMihai Patrascu. 603-610 [doi]
• An optimal ancestry scheme and small universal posetsPierre Fraigniaud, Amos Korman. 611-620 [doi]
• Bilipschitz snowflakes and metrics of negative typeJames R. Lee, Mohammad Moharrami. 621-630 [doi]
• Approximations for the isoperimetric and spectral profile of graphs and related parametersPrasad Raghavendra, David Steurer, Prasad Tetali. 631-640 [doi]
• Weighted geometric set cover via quasi-uniform samplingKasturi Varadarajan. 641-648 [doi]
• Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-inZohar Shay Karnin, Partha Mukhopadhyay, Amir Shpilka, Ilya Volkovich. 649-658 [doi]
• Non-commutative circuits and the sum-of-squares problemPavel Hrubes, Avi Wigderson, Amir Yehudayoff. 667-676 [doi]
• On the hardness of the noncommutative determinantVikraman Arvind, Srikanth Srinivasan. 677-686 [doi]
• A shorter proof of the graph minor algorithm: the unique linkage theoremKen-ichi Kawarabayashi, Paul Wollan. 687-694 [doi]
• Odd cycle packingKen-ichi Kawarabayashi, Bruce A. Reed. 695-704 [doi]
• On the geometry of differential privacyMoritz Hardt, Kunal Talwar. 705-714 [doi]
• Differential privacy under continual observationCynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum. 715-724 [doi]
• On the complexity of #CSPMartin E. Dyer, David Richerby. 725-734 [doi]
• Tractable hypergraph properties for constraint satisfaction and conjunctive queriesDániel Marx. 735-744 [doi]
• Conditional hardness of precedence constrained scheduling on identical machinesOla Svensson. 745-754 [doi]
• Graph expansion and the unique games conjecturePrasad Raghavendra, David Steurer. 755-764 [doi]
• Interactive privacy via the median mechanismAaron Roth, Tim Roughgarden. 765-774 [doi]
• The price of privately releasing contingency tables and the spectra of random matrices with correlated rowsShiva Prasad Kasiviswanathan, Mark Rudelson, Adam Smith, Jonathan Ullman. 775-784 [doi]
• Privacy amplification with asymptotically optimal entropy lossNishanth Chandran, Bhavana Kanukurthi, Rafail Ostrovsky, Leonid Reyzin. 785-794 [doi]
• Erratum for: on basing one-way functions on NP-hardnessAdi Akavia, Oded Goldreich, Shafi Goldwasser, Dana Moshkovitz. 795-796 [doi]