Table of Contents

• 0Mark Bun, Justin Thaler. 1-12 [doi]
• On the Quantitative Hardness of CVPHuck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz. 13-24 [doi]
• Distributed PCP Theorems for Hardness of Approximation in PAmir Abboud, Aviad Rubinstein, R. Ryan Williams. 25-36 [doi]
• Short Presburger Arithmetic Is HardDanny Nguyen, Igor Pak. 37-48 [doi]
• On the Local Structure of Stable Clustering InstancesVincent Cohen-Addad, Chris Schwiegelshohn. 49-60 [doi]
• Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual AlgorithmsSara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, Justin Ward. 61-72 [doi]
• Statistical Query Lower Bounds for Robust Estimation of High-Dimensional Gaussians and Gaussian MixturesIlias Diakonikolas, Daniel M. Kane, Alistair Stewart. 73-84 [doi]
• On Learning Mixtures of Well-Separated GaussiansOded Regev 0001, Aravindan Vijayaraghavan. 85-96 [doi]
• On Small-Depth Frege Proofs for Tseitin for GridsJohan Håstad. 97-108 [doi]
• Random Θ(log n)-CNFs Are Hard for Cutting PlanesNoah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere. 109-120 [doi]
• Random Formulas, Monotone Circuits, and InterpolationPavel Hrubes, Pavel Pudlák. 121-131 [doi]
• Query-to-Communication Lifting for BPPMika Göös, Toniann Pitassi, Thomas Watson 0001. 132-143 [doi]
• A Rounds vs. Communication Tradeoff for Multi-Party Set DisjointnessMark Braverman, Rotem Oshman. 144-155 [doi]
• A Time Hierarchy Theorem for the LOCAL ModelYi-Jun Chang, Seth Pettie. 156-167 [doi]
• 5/4) RoundsChien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak. 168-179 [doi]
• Deterministic Distributed Edge-Coloring via Hypergraph Maximal MatchingManuela Fischer, Mohsen Ghaffari, Fabian Kuhn. 180-191 [doi]
• Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-and-SolveAmir Abboud, Arturs Backurs, Karl Bringmann, Marvin Künnemann. 192-203 [doi]
• Local List Recovery of High-Rate Tensor Codes & ApplicationsBrett Hemenway, Noga Ron-Zewi, Mary Wootters. 204-215 [doi]
• Optimal Repair of Reed-Solomon Codes: Achieving the Cut-Set BoundItzhak Tamo, Min Ye 0005, Alexander Barg. 216-227 [doi]
• Average-Case Reconstruction for the Deletion Channel: Subpolynomially Many Traces SufficeYuval Peres, Alex Zhai. 228-239 [doi]
• Optimal Interactive Coding for Insertions, Deletions, and SubstitutionsAlexander A. Sherstov, Pei Wu. 240-251 [doi]
• The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable CodesDaniel Kane, Shachar Lovett, Sankeerth Rao. 252-259 [doi]
• Approximating Geometric Knapsack via L-PackingsWaldo Gálvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan 0001, Andreas Wiese. 260-271 [doi]
• Removing Depth-Order Cycles among Triangles: An Efficient Algorithm Generating Triangular FragmentsMark de Berg. 272-282 [doi]
• Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming RelaxationsShi Li. 283-294 [doi]
• Fast & Space-Efficient Approximations of Language Edit Distance and RNA Folding: An Amnesic Dynamic Programming ApproachBarna Saha. 295-306 [doi]
• A Dichotomy for Regular Expression Membership TestingKarl Bringmann, Allan Grønlund, Kasper Green Larsen. 307-318 [doi]
• A Dichotomy Theorem for Nonuniform CSPsAndrei A. Bulatov. 319-330 [doi]
• A Proof of CSP Dichotomy ConjectureDmitriy Zhuk. 331-342 [doi]
• Learning Graphical Models Using Multiplicative WeightsAdam R. Klivans, Raghu Meka. 343-354 [doi]
• Active Classification with Comparison QueriesDaniel M. Kane, Shachar Lovett, Shay Moran, Jiapeng Zhang. 355-366 [doi]
• Capacity of Neural Networks for Lifelong Learning of Composable TasksLeslie G. Valiant. 367-378 [doi]
• Efficient Bayesian Estimation from Few Samples: Community Detection and Related ProblemsSamuel B. Hopkins, David Steurer. 379-390 [doi]
• Robust Polynomial Regression up to the Information Theoretic LimitDaniel Kane, Sushrut Karmalkar, Eric Price. 391-402 [doi]
• Quantum SDP-Solvers: Better Upper and Lower BoundsJoran van Apeldoorn, András Gilyén, Sander Gribling, Ronald de Wolf. 403-414 [doi]
• Quantum Speed-Ups for Solving Semidefinite ProgramsFernando G. S. L. Brandão, Krysta M. Svore. 415-426 [doi]
• Local Hamiltonians Whose Ground States Are Hard to ApproximateLior Eldar, Aram Wettroth Harrow. 427-438 [doi]
• On Preparing Ground States of Gapped Hamiltonians: An Efficient Quantum Lovász Local LemmaAndrás Pal Gilyén, Or Sattath. 439-450 [doi]
• Variable-Version Lovász Local Lemma: Beyond Shearer's BoundKun He, Liang Li, Xingwu Liu, Yuyi Wang, Mingji Xia. 451-462 [doi]
• Linear Algebraic Analogues of the Graph Isomorphism Problem and the Erdős-Rényi ModelYinan Li, Youming Qiao. 463-474 [doi]
• Optimal Lower Bounds for Universal Relation, and for Samplers and Finding Duplicates in StreamsMichael Kapralov, Jelani Nelson, Jakub Pachocki, Zhengyu Wang, David P. Woodruff, Mobin Yahyazadeh. 475-486 [doi]
• First Efficient Convergence for Streaming k-PCA: A Global, Gap-Free, and Near-Optimal RateZeyuan Allen Zhu, Yuanzhi Li. 487-492 [doi]
• Weighted k-Server Bounds via Combinatorial DichotomiesNikhil Bansal, Marek Eliás, Grigorios Koumoutsos. 493-504 [doi]
• An Input Sensitive Online Algorithm for the Metric Bipartite Matching ProblemKrati Nayyar, Sharath Raghvendra. 505-515 [doi]
• Learning Multi-Item Auctions with (or without) SamplesYang Cai 0001, Constantinos Daskalakis. 516-527 [doi]
• Oracle-Efficient Online Learning and Auction DesignMiroslav Dudík, Nika Haghtalab, Haipeng Luo, Robert E. Schapire, Vasilis Syrgkanis, Jennifer Wortman Vaughan. 528-539 [doi]
• Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Non-Stochastic InputsPaul Duetting, Michal Feldman, Thomas Kesselheim, Brendan Lucier. 540-551 [doi]
• Tight Lower Bounds for Differentially Private SelectionThomas Steinke, Jonathan Ullman. 552-563 [doi]
• How to Achieve Non-Malleability in One or Two RoundsDakshita Khurana, Amit Sahai. 564-575 [doi]
• Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock PuzzlesHuijia Lin, Rafael Pass, Pratik Soni. 576-587 [doi]
• Garbled Protocols and Two-Round MPC from Bilinear MapsSanjam Garg, Akshayaram Srinivasan. 588-599 [doi]
• Obfuscating Compute-and-Compare Programs under LWEDaniel Wichs, Giorgos Zirdelis. 600-611 [doi]
• Lockable ObfuscationRishab Goyal, Venkata Koppula, Brent Waters. 612-621 [doi]
• White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property TestingIlan Komargodski, Moni Naor, Eylon Yogev. 622-632 [doi]
• Optimality of the Johnson-Lindenstrauss LemmaKasper Green Larsen, Jelani Nelson. 633-638 [doi]
• Optimal Compression of Approximate Inner Products and Dimension ReductionNoga Alon, Bo'az Klartag. 639-650 [doi]
• Sample Efficient Estimation and Recovery in Sparse FFT via Isolation on AverageMichael Kapralov. 651-662 [doi]
• Fast Similarity SketchingSøren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup. 663-671 [doi]
• Sublinear Time Low-Rank Approximation of Positive Semidefinite MatricesCameron Musco, David P. Woodruff. 672-683 [doi]
• Hardness Results for Structured Linear SystemsRasmus Kyng, Peng Zhang. 684-695 [doi]
• The Matching Problem in General Graphs Is in Quasi-NCOla Svensson, Jakub Tarnawski. 696-707 [doi]
• On the Power of Statistical Zero KnowledgeAdam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan. 708-719 [doi]
• The Power of Sum-of-Squares for Detecting Hidden StructuresSamuel B. Hopkins, Pravesh K. Kothari, Aaron Potechin, Prasad Raghavendra, Tselil Schramm, David Steurer. 720-731 [doi]
• A Time-Space Lower Bound for a Large Class of Learning ProblemsRan Raz. 732-742 [doi]
• From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and MoreParinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan. 743-754 [doi]
• Faster (and Still Pretty Simple) Unbiased Estimators for Network (Un)reliabilityDavid R. Karger. 755-766 [doi]
• Minor-Free Graphs Have Light SpannersGlencora Borradaile, Hung Le, Christian Wulff-Nilsen. 767-778 [doi]
• Polylogarithmic Approximation for Minimum Planarization (Almost)Ken-ichi Kawarabayashi, Anastasios Sidiropoulos. 779-788 [doi]
• Approximating the Held-Karp Bound for Metric TSP in Nearly-Linear TimeChandra Chekuri, Kent Quanrud. 789-800 [doi]
• Derandomization Beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic SpaceJack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan. 801-812 [doi]
• Deterministic Search for CNF Satisfying Assignments in Almost Polynomial TimeRocco A. Servedio, Li-Yang Tan. 813-823 [doi]
• Fooling Intersections of Low-Weight HalfspacesRocco A. Servedio, Li-Yang Tan. 824-835 [doi]
• Exponentially-Hard Gap-CSP and Local PRG via Local Hardcore FunctionsBenny Applebaum. 836-847 [doi]
• Testing Hereditary Properties of Ordered Graphs and MatricesNoga Alon, Omri Ben-Eliezer, Eldar Fischer. 848-858 [doi]
• A Characterization of Testable Hypergraph PropertiesFelix Joos, Jaehoon Kim, Daniela Kühn, Deryk Osthus. 859-867 [doi]
• 3/4) Adaptive QueriesXi Chen, Erik Waingarten, Jinyu Xie. 868-879 [doi]
• Generalized Uniformity TestingTugkan Batu, Clément L. Canonne. 880-889 [doi]
• Much Faster Algorithms for Matrix ScalingZeyuan Allen Zhu, Yuanzhi Li, Rafael Oliveira, Avi Wigderson. 890-901 [doi]
• Matrix Scaling and Balancing via Box Constrained Newton's Method and Interior Point MethodsMichael B. Cohen, Aleksander Madry, Dimitris Tsipras, Adrian Vladu. 902-913 [doi]
• Simply Exponential Approximation of the Permanent of Positive Semidefinite MatricesNima Anari, Leonid Gurvits, Shayan Oveis Gharan, Amin Saberi. 914-925 [doi]
• Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning TreesDavid Durfee, John Peebles, Richard Peng, Anup B. Rao. 926-937 [doi]
• Optimal Las Vegas Locality Sensitive Data StructuresThomas Dybdahl Ahle. 938-949 [doi]
• Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update TimeDanupon Nanongkai, Thatchaphol Saranurak, Christian Wulff-Nilsen. 950-961 [doi]
• Fast and Compact Exact Distance Oracle for Planar GraphsVincent Cohen-Addad, Søren Dahlgaard, Christian Wulff-Nilsen. 962-973 [doi]
• High Dimensional Expanders Imply Agreement ExpandersIrit Dinur, Tali Kaufman. 974-985 [doi]
• The Ising Partition Function: Zeros and Deterministic ApproximationJingcheng Liu 0001, Alistair Sinclair, Piyush Srivastava. 986-997 [doi]
• Eldan's Stochastic Localization and the KLS Hyperplane Conjecture: An Improved Lower Bound for ExpansionYin Tat Lee, Santosh Srinivas Vempala. 998-1007 [doi]
• Weak Decoupling, Polynomial Folds and Approximate Optimization over the SphereVijay V. S. P. Bhattiprolu, Mrinal Kanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani. 1008-1019 [doi]
• Subdeterminant Maximization via Nonconvex Relaxations and Anti-ConcentrationJavad B. Ebrahimi, Damian Straszak, Nisheeth K. Vishnoi. 1020-1031 [doi]
• Hashing-Based-Estimators for Kernel Density in High DimensionsMoses Charikar, Paris Siminelakis. 1032-1043 [doi]