Table of Contents

• Bounded-Communication Leakage Resilience via Parity-Resilient CircuitsVipul Goyal, Yuval Ishai, Hemanta K. Maji, Amit Sahai, Alexander A. Sherstov. 1-10 [doi]
• Indistinguishability Obfuscation from DDH-Like Assumptions on Constant-Degree Graded EncodingsHuijia Lin, Vinod Vaikuntanathan. 11-20 [doi]
• Breaking the Three Round Barrier for Non-malleable CommitmentsVipul Goyal, Dakshita Khurana, Amit Sahai. 21-30 [doi]
• Zero-Knowledge Proof Systems for QMAAnne Broadbent, Zhengfeng Ji, Fang Song 0001, John Watrous. 31-40 [doi]
• Strong Fooling Sets for Multi-player Communication with Applications to Deterministic Estimation of Stream StatisticsAmit Chakrabarti, Sagar Kale. 41-50 [doi]
• Edit Distance: Sketching, Streaming, and Document ExchangeDjamal Belazzougui, Qin Zhang. 51-60 [doi]
• Heavy Hitters via Cluster-Preserving ClusteringKasper Green Larsen, Jelani Nelson, Huy L. Nguyen, Mikkel Thorup. 61-70 [doi]
• Optimal Quantile Approximation in StreamsZohar S. Karnin, Kevin Lang, Edo Liberty. 71-78 [doi]
• An Average-Case Depth Hierarchy Theorem for Higher DepthJohan Håstad. 79-88 [doi]
• A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit FunctionMagnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov. 89-98 [doi]
• Depth-Reduction for CompositesShiteng Chen, Periklis A. Papakonstantinou. 99-108 [doi]
• A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity TestingAnkit Garg, Leonid Gurvits, Rafael Oliveira, Avi Wigderson. 109-117 [doi]
• The Salesman's Improved Paths: A 3/2+1/34 ApproximationAndrás Sebö, Anke van Zuylen. 118-127 [doi]
• Hopsets with Constant Hopbound, and Applications to Approximate Shortest PathsMichael Elkin, Ofer Neiman. 128-137 [doi]
• Better Unrelated Machine Scheduling for Weighted Completion Time via Random Offsets from Non-uniform DistributionsSungjin Im, Shi Li. 138-147 [doi]
• Online Algorithms for Covering and Packing Problems with Convex ObjectivesYossi Azar, Niv Buchbinder, T.-H. Hubert Chan, Shahar Chen, Ilan Reuven Cohen, Anupam Gupta, Zhiyi Huang 0002, Ning Kang, Viswanath Nagarajan, Joseph Naor, Debmalya Panigrahi. 148-157 [doi]
• Explicit Non-malleable Extractors, Multi-source Extractors, and Almost Optimal Privacy Amplification ProtocolsEshan Chattopadhyay, Xin Li. 158-167 [doi]
• Improved Two-Source Extractors, and Affine Extractors for Polylogarithmic EntropyXin Li. 168-177 [doi]
• Extractors for Near Logarithmic Min-EntropyGil Cohen, Leonard J. Schulman. 178-187 [doi]
• Making the Most of Advice: New Correlation Breakers and Their ApplicationsGil Cohen. 188-196 [doi]
• The Hilbert Function, Algebraic Extractors, and Recursive Fourier SamplingZachary Remscrim. 197-208 [doi]
• Computational Efficiency Requires Simple TaxationShahar Dobzinski. 209-218 [doi]
• Learning in Auctions: Regret is Hard, Envy is EasyConstantinos Daskalakis, Vasilis Syrgkanis. 219-228 [doi]
• On the Communication Complexity of Approximate Fixed PointsTim Roughgarden, Omri Weinstein. 229-238 [doi]
• Informational SubstitutesYiling Chen, Bo Waggoner. 239-247 [doi]
• Constrained Submodular Maximization: Beyond 1/eAlina Ene, Huy L. Nguyen. 248-257 [doi]
• Settling the Complexity of Computing Approximate Two-Player Nash EquilibriaAviad Rubinstein. 258-265 [doi]
• Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity LearningRan Raz. 266-275 [doi]
• Ramanujan Graphs in Polynomial TimeMichael B. Cohen. 276-281 [doi]
• Structure of Protocols for XOR FunctionsHamed Hatami, Kaave Hosseini, Shachar Lovett. 282-288 [doi]
• The Multiparty Communication Complexity of Interleaved Group ProductsW. T. Gowers, Emanuele Viola. 289-294 [doi]
• How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity)Susanna F. de Rezende, Jakob Nordström, Marc Vinyals. 295-304 [doi]
• Amortized Dynamic Cell-Probe Lower Bounds from Four-Party CommunicationOmri Weinstein, Huacheng Yu. 305-314 [doi]
• Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update TimeShiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Jakub Lacki, Nikos Parotsidis. 315-324 [doi]
• Fully Dynamic Maximal Matching in Constant Update TimeShay Solomon. 325-334 [doi]
• On Fully Dynamic Graph SparsifiersIttai Abraham, David Durfee, Ioannis Koutis, Sebastian Krinninger, Richard Peng. 335-344 [doi]
• Linear Hashing Is AwesomeMathias Bæk Tejs Knudsen. 345-352 [doi]
• Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free MetricsVincent Cohen-Addad, Philip N. Klein, Claire Mathieu. 353-364 [doi]
• Local Search Yields a PTAS for k-Means in Doubling MetricsZachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour. 365-374 [doi]
• Truly Sub-cubic Algorithms for Language Edit Distance and RNA-Folding via Fast Bounded-Difference Min-Plus ProductKarl Bringmann, Fabrizio Grandoni, Barna Saha, Virginia Vassilevska Williams. 375-384 [doi]
• Knuth Prize Lecture: Complexity of Communication in MarketsNoam Nisan. 385 [doi]
• No Occurrence Obstructions in Geometric Complexity TheoryPeter Bürgisser, Christian Ikenmeyer, Greta Panova. 386-395 [doi]
• Rectangular Kronecker Coefficients and Plethysms in Geometric Complexity TheoryChristian Ikenmeyer, Greta Panova. 396-405 [doi]
• Exponential Lower Bounds for Monotone Span ProgramsRobert Robere, Toniann Pitassi, Benjamin Rossman, Stephen A. Cook. 406-415 [doi]
• A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of AgentsHaris Aziz, Simon Mackenzie. 416-427 [doi]
• A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique ProblemBoaz Barak, Samuel B. Hopkins, Jonathan A. Kelner, Pravesh Kothari, Ankur Moitra, Aaron Potechin. 428-437 [doi]
• Polynomial-Time Tensor Decompositions with Sum-of-SquaresTengyu Ma, Jonathan Shi, David Steurer. 438-446 [doi]
• Towards Strong Reverse Minkowski-Type Inequalities for LatticesDaniel Dadush, Oded Regev. 447-456 [doi]
• Which Regular Expression Patterns Are Hard to Match?Arturs Backurs, Piotr Indyk. 457-466 [doi]
• Polynomial Representations of Threshold Functions and Algorithmic ApplicationsJosh Alman, Timothy M. Chan, R. Ryan Williams. 467-476 [doi]
• Popular Conjectures as a Barrier for Dynamic Planar Graph AlgorithmsAmir Abboud, Søren Dahlgaard. 477-486 [doi]
• Max-Information, Differential Privacy, and Post-selection Hypothesis TestingRyan M. Rogers, Aaron Roth, Adam D. Smith, Om Thakkar. 487-494 [doi]
• Lipschitz Extensions for Node-Private Graph Statistics and the Generalized Exponential MechanismSofya Raskhodnikova, Adam Smith. 495-504 [doi]
• The Constant Inapproximability of the Parameterized Dominating Set ProblemYijia Chen, Bingkai Lin. 505-514 [doi]
• Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern CoveringFedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh. 515-524 [doi]
• Testing Assignments to Constraint Satisfaction ProblemsHubie Chen, Matthew Valeriote, Yuichi Yoshida. 525-534 [doi]
• Compressing Interactive Communication under Product DistributionsAlexander A. Sherstov. 535-544 [doi]
• Decidability of Non-interactive Simulation of Joint DistributionsBadih Ghazi, Pritish Kamath, Madhu Sudan. 545-554 [doi]
• Separations in Communication Complexity Using Cheat Sheets and Information ComplexityAnurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain 0001, Robin Kothari, Troy Lee, Miklos Santha. 555-564 [doi]
• Extension Complexity of Independent Set PolytopesMika Göös, Rahul Jain 0001, Thomas Watson 0001. 565-572 [doi]
• Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and SimpleRasmus Kyng, Sushant Sachdeva. 573-582 [doi]
• Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and MoreMichael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Aaron Sidford, Adrian Vladu. 583-592 [doi]
• Computing Maximum Flow with Augmenting Electrical FlowsAleksander Madry. 593-602 [doi]
• Optimizing Star-Convex FunctionsJasper C. H. Lee, Paul Valiant. 603-614 [doi]
• An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL ModelYi-Jun Chang, Tsvi Kopelowitz, Seth Pettie. 615-624 [doi]
• Local Conflict ColoringPierre Fraigniaud, Marc Heinrich, Adrian Kosowski. 625-634 [doi]
• A Fast and Simple Unbiased Estimator for Network (Un)reliabilityDavid R. Karger. 635-644 [doi]
• A New Framework for Distributed Submodular MaximizationRafael da Ponte Barbosa, Alina Ene, Huy L. Nguyen, Justin Ward. 645-654 [doi]
• Robust Estimators in High Dimensions without the Computational IntractabilityIlias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li 0001, Ankur Moitra, Alistair Stewart. 655-664 [doi]
• Agnostic Estimation of Mean and CovarianceKevin A. Lai, Anup B. Rao, Santosh Vempala. 665-674 [doi]
• Noisy Population Recovery in Polynomial TimeAnindya De, Michael E. Saks, Sijian Tang. 675-684 [doi]
• A New Approach for Testing Properties of Discrete DistributionsIlias Diakonikolas, Daniel M. Kane. 685-694 [doi]
• How to Determine if a Random Graph with a Fixed Degree Sequence Has a Giant ComponentFelix Joos, Guillem Perarnau, Dieter Rautenbach, Bruce A. Reed. 695-703 [doi]
• Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core ModelCharilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda, Yitong Yin. 704-713 [doi]
• Simulated Quaotum Annealing Can Be Exponentially Faster Than Classical Simulated AnnealingElizabeth Crosson, Aram Wettroth Harrow. 714-723 [doi]
• The Number of Solutions for Random Regular NAE-SATAllan Sly, Nike Sun, Yumeng Zhang. 724-731 [doi]
• Accelerated Newton Iteration for Roots of Black Box PolynomialsAnand Louis, Santosh Srinivas Vempala. 732-740 [doi]
• Fourier-Sparse Interpolation without a Frequency GapXue Chen, Daniel M. Kane, Eric Price, Zhao Song. 741-750 [doi]
• Robust Fourier and Polynomial Curve FittingVenkatesan Guruswami, David Zuckerman. 751-759 [doi]
• NP-Hardness of Reed-Solomon Decoding and the Prouhet-Tarry-Escott ProblemVenkata Gandikota, Badih Ghazi, Elena Grigorescu. 760-769 [doi]
• Amplification and Derandomization without SlowdownOfer Grossman, Dana Moshkovitz. 770-779 [doi]
• Commutativity in the Algorithmic Lovász Local LemmaVladimir Kolmogorov. 780-787 [doi]
• An Algorithm for Komlós Conjecture Matching Banaszczyk's BoundNikhil Bansal, Daniel Dadush, Shashwat Garg. 788-799 [doi]
• Universal Simulation of Directed Systems in the Abstract Tile Assembly Model Requires UndirectednessJacob Hendricks, Matthew J. Patitz, Trent A. Rogers. 800-809 [doi]
• A PTAS for the Steiner Forest Problem in Doubling MetricsT.-H. Hubert Chan, Shuguang Hu, Shaofeng H.-C. Jiang. 810-819 [doi]
• On Approximating Maximum Independent Set of RectanglesJulia Chuzhoy, Alina Ene. 820-829 [doi]