Table of Contents

• Balancing Vectors in Any NormDaniel Dadush, Aleksandar Nikolov, Kunal Talwar, Nicole Tomczak-Jaegermann. 1-10 [doi]
• Metric Sublinear Algorithms via Linear SamplingHossein Esfandiari, Michael Mitzenmacher. 11-22 [doi]
• Approximating the Permanent of a Random Matrix with Vanishing MeanLior Eldar, Saeed Mehraban. 23-34 [doi]
• Log-Concave Polynomials, Entropy, and a Deterministic Approximation Algorithm for Counting Bases of MatroidsNima Anari, Shayan Oveis Gharan, Cynthia Vinzant. 35-46 [doi]
• A Short List of Equalities Induces Large Sign RankArkadev Chattopadhyay, Nikhil S. Mande. 47-58 [doi]
• Simple Optimal Hitting Sets for Small-Success RLWilliam Hoza, David Zuckerman. 59-64 [doi]
• Hardness Magnification for Natural ProblemsIgor Carboni Oliveira, Rahul Santhanam. 65-76 [doi]
• Counting t-Cliques: Worst-Case to Average-Case Reductions and Direct Interactive Proof SystemsOded Goldreich 0001, Guy N. Rothblum. 77-88 [doi]
• A Faster Isomorphism Test for Graphs of Small DegreeMartin Grohe, Daniel Neuen, Pascal Schweitzer. 89-100 [doi]
• Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree AlgorithmMatthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, Shen Chen Xu. 101-112 [doi]
• Faster Exact and Approximate Algorithms for k-CutAnupam Gupta, Euiwoong Lee, Jason Li. 113-123 [doi]
• Delegating Computations with (Almost) Minimal Time and Space OverheadJustin Holmgren, Ron Rothblum. 124-135 [doi]
• Computational Two-Party Correlation: A Dichotomy for Key-Agreement ProtocolsIftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak. 136-147 [doi]
• PPP-Completeness with Connections to CryptographyKaterina Sotiraki, Manolis Zampetakis, Giorgos Zirdelis. 148-158 [doi]
• Hölder Homeomorphisms and Approximate Nearest NeighborsAlexandr Andoni, Assaf Naor, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten. 159-169 [doi]
• Near-Optimal Approximate Decremental All Pairs Shortest PathsShiri Chechik. 170-181 [doi]
• Bloom Filters, Adaptivity, and the Dictionary ProblemMichael A. Bender, Martin Farach-Colton, Mayank Goswami, Rob Johnson, Samuel McCauley, Shikha Singh 0002. 182-193 [doi]
• MDS Matrices over Small Fields: A Proof of the GM-MDS ConjectureShachar Lovett. 194-199 [doi]
• Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit ErrorsKuan Cheng, Zhengzhong Jin, Xin Li, Ke Wu. 200-211 [doi]
• Improved Decoding of Folded Reed-Solomon and Multiplicity CodesSwastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters. 212-223 [doi]
• An Improved Bound for Weak Epsilon-Nets in the PlaneNatan Rubin. 224-235 [doi]
• The Complexity of General-Valued CSPs Seen from the Other SideClément Carbonnel, Miguel Romero 0001, Stanislav Zivny. 236-246 [doi]
• Non-Black-Box Worst-Case to Average-Case Reductions within NPShuichi Hirahara. 247-258 [doi]
• Classical Verification of Quantum ComputationsUrmila Mahadev. 259-267 [doi]
• Contextual Search via Intrinsic VolumesRenato Paes Leme, Jon Schneider. 268-282 [doi]
• Towards Learning Sparsely Used Dictionaries with Arbitrary SupportsPranjal Awasthi, Aravindan Vijayaraghavan. 283-296 [doi]
• Learning Sums of Independent Random Variables with Sparse Collective SupportAnindya De, Philip M. Long, Rocco A. Servedio. 297-308 [doi]
• Recharging BanditsRobert Kleinberg, Nicole Immorlica. 309-319 [doi]
• A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum DeviceZvika Brakerski, Paul Christiano, Urmila Mahadev, Umesh V. Vazirani, Thomas Vidick. 320-331 [doi]
• Classical Homomorphic Encryption for Quantum CircuitsUrmila Mahadev. 332-338 [doi]
• Classical Lower Bounds from Quantum Upper BoundsShalev Ben-David, Adam Bouland, Ankit Garg, Robin Kothari. 339-349 [doi]
• Quantum Algorithm for Simulating Real Time Evolution of Lattice HamiltoniansJeongwan Haah, Matthew B. Hastings, Robin Kothari, Guang Hao Low. 350-360 [doi]
• Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle DecompositionsTimothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, Junxing Wang. 361-372 [doi]
• A Matrix Chernoff Bound for Strongly Rayleigh Distributions and Spectral Sparsifiers from a few Random Spanning TreesRasmus Kyng, Zhao Song. 373-384 [doi]
• Spectral Subspace SparsificationHuan Li, Aaron Schild. 385-396 [doi]
• Near-Optimal Communication Lower Bounds for Approximate Nash EquilibriaMika Göös, Aviad Rubinstein. 397-403 [doi]
• An End-to-End Argument in Mechanism Design (Prior-Independent Auctions for Budgeted Agents)Yiding Feng, Jason D. Hartline. 404-415 [doi]
• The Sample Complexity of Up-to-ε Multi-Dimensional Revenue MaximizationYannai A. Gonczarowski, S. Matthew Weinberg. 416-426 [doi]
• Improved Online Algorithm for Weighted Flow TimeYossi Azar, Noam Touitou. 427-437 [doi]
• Fusible HSTs and the Randomized k-Server ConjectureJames R. Lee. 438-449 [doi]
• An ETH-Tight Exact Algorithm for Euclidean TSPMark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay. 450-461 [doi]
• 0/1/All CSPs, Half-Integral A-Path Packing, and Linear-Time FPT AlgorithmsYoichi Iwata, Yutaro Yamaguchi, Yuichi Yoshida. 462-473 [doi]
• On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar GraphsDániel Marx, Marcin Pilipczuk, Michal Pilipczuk. 474-484 [doi]
• Deterministic Factorization of Sparse Polynomials with Bounded Individual DegreeVishwas Bhargava, Shubhangi Saraf, Ilya Volkovich. 485-496 [doi]
• Testing Graph Clusterability: Algorithms and Lower BoundsAshish Chiplunkar, Michael Kapralov, Sanjeev Khanna, Aida Mousavifar, Yuval Peres. 497-508 [doi]
• Finding Forbidden Minors in Sublinear Time: A n^1/2+o(1)-Query One-Sided Tester for Minor Closed Properties on Bounded Degree GraphsAkash Kumar 0003, C. Seshadhri, Andrew Stolman. 509-520 [doi]
• Privacy Amplification by IterationVitaly Feldman, Ilya Mironov, Kunal Talwar, Abhradeep Thakurta. 521-532 [doi]
• Revealing Network Structure, Confidentially: Improved Rates for Node-Private Graphon EstimationChristian Borgs, Jennifer T. Chayes, Adam D. Smith, Ilias Zadik. 533-543 [doi]
• Perfect Lp Sampling in a Data StreamRajesh Jayaram, David P. Woodruff. 544-555 [doi]
• The Sketching Complexity of Graph and Hypergraph CountingJohn Kallaugher, Michael Kapralov, Eric Price. 556-567 [doi]
• EPTAS for Max Clique on Disks and Unit BallsMarthe Bonamy, Edouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé. 568-579 [doi]
• Limits on All Known (and Some Unknown) Approaches to Matrix MultiplicationJosh Alman, Virginia Vassilevska Williams. 580-591 [doi]
• Pseudorandom Sets in Grassmann Graph Have Near-Perfect ExpansionSubhash Khot, Dor Minzer, Muli Safra. 592-601 [doi]
• Knuth Prize Lecture: On the Difficulty of Approximating Boolean Max-CSPsJohan Håstad. 602 [doi]
• Dispersion for Data-Driven Algorithm Design, Online Learning, and Private OptimizationMaria-Florina Balcan, Travis Dick, Ellen Vitercik. 603-614 [doi]
• Efficient Density Evaluation for Smooth KernelsArturs Backurs, Moses Charikar, Piotr Indyk, Paris Siminelakis. 615-626 [doi]
• Efficiently Learning Mixtures of Mallows ModelsAllen Liu, Ankur Moitra. 627-638 [doi]
• Efficient Statistics, in High Dimensions, from Truncated SamplesConstantinos Daskalakis, Themis Gouleakis, Christos Tzamos, Manolis Zampetakis. 639-649 [doi]
• Planar Graph Perfect Matching Is in NCNima Anari, Vijay V. Vazirani. 650-661 [doi]
• On Derandomizing Local Distributed AlgorithmsMohsen Ghaffari, David G. Harris, Fabian Kuhn. 662-673 [doi]
• Parallel Graph Connectivity in Log Diameter RoundsAlexandr Andoni, Zhao Song, Clifford Stein, Zhengyu Wang, Peilin Zhong. 674-685 [doi]
• A Faster Distributed Single-Source Shortest Paths AlgorithmSebastian Forster, Danupon Nanongkai. 686-697 [doi]
• 1-Factorizations of Pseudorandom GraphsAsaf Ferber, Vishesh Jain. 698-708 [doi]
• Sublinear Algorithms for Local Graph Centrality EstimationMarco Bressan 0002, Enoch Peserico, Luca Pretto. 709-718 [doi]
• Efficient Polynomial-Time Approximation Scheme for the Genus of Dense GraphsBojan Mohar, Yifan Jing. 719-730 [doi]
• Low-Degree Testing for Quantum States, and a Quantum Entangled Games PCP for QMAAnand Natarajan, Thomas Vidick. 731-742 [doi]
• Constant Overhead Quantum Fault-Tolerance with Quantum Expander CodesOmar Fawzi, Antoine Grospellier, Anthony Leverrier. 743-754 [doi]
• Spatial Isolation Implies Zero Knowledge Even in a Quantum WorldAlessandro Chiesa, Michael A. Forbes, Tom Gur, Nicholas Spooner. 755-765 [doi]
• Beating the Integrality Ratio for s-t-Tours in GraphsVera Traub, Jens Vygen. 766-777 [doi]
• Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-Polynomial TimeJatin Batra, Naveen Garg 0001, Amit Kumar. 778-789 [doi]
• Random Order Contention Resolution SchemesMarek Adamczyk, Michal Wlodarczyk 0001. 790-801 [doi]
• Strong Coresets for k-Median and Subspace Approximation: Goodbye DimensionChristian Sohler, David P. Woodruff. 802-813 [doi]
• Epsilon-Coresets for Clustering (with Outliers) in Doubling MetricsLingxiao Huang, Shaofeng Jiang, Jian Li, Xuan Wu. 814-825 [doi]
• Non-Malleable Codes for Small-Depth CircuitsMarshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan. 826-837 [doi]
• Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private SamplingAmos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri. 838-849 [doi]
• Cryptographic Hashing from Strong One-Way Functions (Or: One-Way Product Functions and Their Applications)Justin Holmgren, Alex Lombardi. 850-858 [doi]
• Laconic Function Evaluation and ApplicationsWilly Quach, Hoeteck Wee, Daniel Wichs. 859-870 [doi]
• PanORAMa: Oblivious RAM with Logarithmic OverheadSarvar Patel, Giuseppe Persiano, Mariana Raykova 0001, Kevin Yeo. 871-882 [doi]
• Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment PolytopesPeter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson. 883-897 [doi]
• Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU FactorizationsMichael B. Cohen, Jonathan A. Kelner, Rasmus Kyng, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford. 898-909 [doi]
• The Diameter of the Fractional Matching Polytope and Its Hardness ImplicationsLaura Sanità. 910-921 [doi]
• Coordinate Methods for Accelerating ℓ∞ Regression and Faster Approximate Maximum FlowAaron Sidford, Kevin Tian. 922-933 [doi]
• A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear CircuitsSuryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan 0001. 934-945 [doi]
• Pseudorandom Generators for Read-Once Branching Programs, in Any OrderMichael A. Forbes, Zander Kelley. 946-955 [doi]
• Indistinguishability by Adaptive Procedures with Advice, and Lower Bounds on Hardness Amplification ProofsAryeh Grinberg, Ronen Shaltiel, Emanuele Viola. 956-966 [doi]
• Near Log-Convexity of Measured Heat in (Discrete) Time and ConsequencesMert Saglam. 967-978 [doi]
• Approximating Edit Distance within Constant Factor in Truly Sub-Quadratic TimeDiptarka Chakraborty, Debarati Das 0001, Elazar Goldenberg, Michal Koucký, Michael E. Saks. 979-990 [doi]