Table of Contents

• (2 + epsilon)-Sat Is NP-HardPer Austrin, Johan Håstad, Venkatesan Guruswami. 1-10 [doi]
• A Counter-example to Karlin's Strong Conjecture for Fictitious PlayConstantinos Daskalakis, Qinxuan Pan. 11-20 [doi]
• A Simple and Approximately Optimal Mechanism for an Additive BuyerMoshe Babaioff, Nicole Immorlica, Brendan Lucier, S. Matthew Weinberg. 21-30 [doi]
• Achieving Target Equilibria in Network Routing Games without Knowing the Latency FunctionsUmang Bhaskar, Katrina Ligett, Leonard J. Schulman, Chaitanya Swamy. 31-40 [doi]
• An Algebraic Approach to Non-malleabilityVipul Goyal, Silas Richelson, Alon Rosen, Margarita Vald. 41-50 [doi]
• An Automatic Inequality Prover and Instance Optimal Identity TestingGregory Valiant, Paul Valiant. 51-60 [doi]
• An Exponential Lower Bound for Homogeneous Depth Four Arithmetic FormulasNeeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan. 61-70 [doi]
• Barriers to Near-Optimal EquilibriaTim Roughgarden. 71-80 [doi]
• Bi-Lipschitz Bijection between the Boolean Cube and the Hamming BallItai Benjamini, Gil Cohen, Igor Shinkar. 81-89 [doi]
• Bounds on the Permanent and Some ApplicationsLeonid Gurvits, Alex Samorodnitsky. 90-99 [doi]
• Chasing Ghosts: Competing with Stateful PoliciesUriel Feige, Tomer Koren, Moshe Tennenholtz. 100-109 [doi]
• Circuit Complexity, Proof Complexity, and Polynomial Identity TestingJoshua A. Grochow, Toniann Pitassi. 110-119 [doi]
• Complexity Classification of Local Hamiltonian ProblemsToby S. Cubitt, Ashley Montanaro. 120-129 [doi]
• Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number CountsRadu Curticapean, Dániel Marx. 130-139 [doi]
• Constructive Discrepancy Minimization for Convex SetsThomas Rothvoss. 140-145 [doi]
• Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update TimeMonika Henzinger, Sebastian Krinninger, Danupon Nanongkai. 146-155 [doi]
• Digital Morphogenesis via Schelling SegregationGeorge Barmpalias, Richard Elwes, Andy Lewis-Pye. 156-165 [doi]
• Dynamic Integer Sets with Optimal Rank, Select, and Predecessor SearchMihai Patrascu, Mikkel Thorup. 166-175 [doi]
• Exponential Separation of Information and CommunicationAnat Ganor, Gillat Kol, Ran Raz. 176-185 [doi]
• Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded TreewidthDaniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh. 186-195 [doi]
• Generating k-Independent Variables in Constant TimeTobias Christiani, Rasmus Pagh. 196-205 [doi]
• Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with exp(log^{Omega(1)} n) ColorsSubhash Khot, Rishi Saket. 206-215 [doi]
• Improved Quantum Algorithm for Triangle Finding via Combinatorial ArgumentsFrançois Le Gall. 216-225 [doi]
• Interactive Channel Capacity RevisitedBernhard Haeupler. 226-235 [doi]
• List and Unique Coding for Interactive Communication in the Presence of Adversarial NoiseMark Braverman, Klim Efremenko. 236-245 [doi]
• Local Tests of Global Entanglement and a Counterexample to the Generalized Area LawDorit Aharonov, Aram Wettroth Harrow, Zeph Landau, Daniel Nagaj, Mario Szegedy, Umesh V. Vazirani. 246-255 [doi]
• LP-Based Algorithms for Capacitated Facility LocationHyung-Chan An, Mohit Singh, Ola Svensson. 256-265 [doi]
• Mechanism Design for Crowdsourcing: An Optimal 1-1/e Competitive Budget-Feasible Mechanism for Large MarketsNima Anari, Gagan Goel, Afshin Nikzad. 266-275 [doi]
• Network Sparsification for Steiner Problems on Planar and Bounded-Genus GraphsMarcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen. 276-285 [doi]
• New Algorithms and Lower Bounds for Monotonicity TestingXi Chen, Rocco A. Servedio, Li-Yang Tan. 286-295 [doi]
• Noisy Interactive Quantum CommunicationGilles Brassard, Ashwin Nayak, Alain Tapp, Dave Touchette, Falk Unger. 296-305 [doi]
• Non-malleable Codes against Constant Split-State TamperingEshan Chattopadhyay, David Zuckerman. 306-315 [doi]
• Novel Polynomial Basis and Its Application to Reed-Solomon Erasure CodesSian-Jheng Lin, Wei-Ho Chung, Yunghsiang S. Han. 316-325 [doi]
• O(log log Rank) Competitive Ratio for the Matroid Secretary ProblemOded Lachish. 326-335 [doi]
• On Learning and Testing Dynamic EnvironmentsOded Goldreich, Dana Ron. 336-343 [doi]
• On the AC0 Complexity of Subgraph IsomorphismYuan Li, Alexander A. Razborov, Benjamin Rossman. 344-353 [doi]
• On the Hardness of SignalingShaddin Dughmi. 354-363 [doi]
• On the Power of Homogeneous Depth 4 Arithmetic CircuitsMrinal Kumar, Shubhangi Saraf. 364-373 [doi]
• One-Way Functions and (Im)Perfect ObfuscationIlan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev. 374-383 [doi]
• Online Bipartite Matching in Offline TimeBartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych. 384-393 [doi]
• Optimal Error Rates for Interactive Coding II: Efficiency and List DecodingMohsen Ghaffari, Bernhard Haeupler. 394-403 [doi]
• Outsourcing Private RAM ComputationCraig Gentry, Shai Halevi, Mariana Raykova 0001, Daniel Wichs. 404-413 [doi]
• Parallel Repetition from FortificationDana Moshkovitz. 414-423 [doi]
• Path Finding Methods for Linear Programming: Solving Linear Programs in Õ(vrank) Iterations and Faster Algorithms for Maximum FlowYin Tat Lee, Aaron Sidford. 424-433 [doi]
• Popular Conjectures Imply Strong Lower Bounds for Dynamic ProblemsAmir Abboud, Virginia Vassilevska Williams. 434-443 [doi]
• Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGsParinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai. 444-453 [doi]
• Preventing False Discovery in Interactive Data Analysis Is HardMoritz Hardt, Jonathan Ullman. 454-463 [doi]
• Private Empirical Risk Minimization: Efficient Algorithms and Tight Error BoundsRaef Bassily, Adam Smith, Abhradeep Thakurta. 464-473 [doi]
• Quantum Attacks on Classical Proof Systems: The Hardness of Quantum RewindingAndris Ambainis, Ansis Rosmanis, Dominique Unruh. 474-483 [doi]
• Ramanujan Complexes and Bounded Degree Topological ExpandersTali Kaufman, David Kazhdan, Alexander Lubotzky. 484-493 [doi]
• Random Walks That Find Perfect Objects and the Lovasz Local LemmaDimitris Achlioptas, Fotis Iliopoulos. 494-503 [doi]
• Randomized Mutual Exclusion with Constant Amortized RMR Complexity on the DSMGeorge Giakkoupis, Philipp Woelfel. 504-513 [doi]
• Sample-Optimal Fourier Sampling in Any Constant DimensionPiotr Indyk, Michael Kapralov. 514-523 [doi]
• Satisfiability and EvolutionAdi Livnat, Christos H. Papadimitriou, Aviad Rubinstein, Gregory Valiant, Andrew Wan. 524-530 [doi]
• SelfishMigrate: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous ProcessorsSungjin Im, Janardhan Kulkarni, Kamesh Munagala, Kirk Pruhs. 531-540 [doi]
• Settling the APX-Hardness Status for Geometric Set CoverNabil H. Mustafa, Rajiv Raman, Saurabh Ray. 541-550 [doi]
• Shrinkage of De Morgan Formulae by Spectral TechniquesAvishay Tal. 551-560 [doi]
• Single Pass Spectral Sparsification in Dynamic StreamsMichael Kapralov, Yin Tat Lee, Cameron Musco, Christopher Musco, Aaron Sidford. 561-570 [doi]
• Solving Optimization Problems with Diseconomies of Scale via DecouplingKonstantin Makarychev, Maxim Sviridenko. 571-580 [doi]
• Spectral Approaches to Nearest Neighbor SearchAmirali Abdullah, Alexandr Andoni, Ravindran Kannan, Robert Krauthgamer. 581-590 [doi]
• The Communication Complexity of Distributed epsilon-ApproximationsZengfeng Huang, Ke Yi. 591-600 [doi]
• The Complexity of Counting Edge Colorings and a Dichotomy for Some Higher Domain Holant ProblemsJin-yi Cai, Heng Guo, Tyson Williams. 601-610 [doi]
• The Dyck Language Edit Distance Problem in Near-Linear TimeBarna Saha. 611-620 [doi]
• Threesomes, Degenerates, and Love TrianglesAllan Grønlund Jørgensen, Seth Pettie. 621-630 [doi]
• Topology Matters in CommunicationArkadev Chattopadhyay, Jaikumar Radhakrishnan, Atri Rudra. 631-640 [doi]
• Total Space in ResolutionIlario Bonacina, Nicola Galesi, Neil Thapen. 641-650 [doi]
• Understanding Alternating Minimization for Matrix CompletionMoritz Hardt. 651-660 [doi]
• Why Walking the Dog Takes Time: Frechet Distance Has No Strongly Subquadratic Algorithms Unless SETH FailsKarl Bringmann. 661-670 [doi]