Table of Contents

• An improved approximation algorithm for ATSPVera Traub, Jens Vygen. 1-13 [doi]
• Reducing path TSP to TSPVera Traub, Jens Vygen, Rico Zenklusen. 14-27 [doi]
• An improved approximation algorithm for TSP in the half integral caseAnna R. Karlin, Nathan Klein, Shayan Oveis Gharan. 28-39 [doi]
• Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplicationJesper Nederlof. 40-53 [doi]
• Semi-algebraic proofs, IPS lower bounds, and the τ-conjecture: can a natural number be negative?Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret. 54-67 [doi]
• Automating cutting planes is NP-hardMika Göös, Sajin Koroth, Ian Mertz, Toniann Pitassi. 68-77 [doi]
• (Semi)Algebraic proofs over ±1 variablesDmitry Sokolov 0005. 78-90 [doi]
• QCSP monsters and the demise of the chen conjectureDmitriy Zhuk, Barnaby Martin. 91-104 [doi]
• Contention resolution without collision detectionMichael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Seth Pettie. 105-118 [doi]
• Optimal time and space leader election in population protocolsPetra Berenbrink, George Giakkoupis, Peter Kling. 119-129 [doi]
• A lower bound for parallel submodular minimizationEric Balkanski, Yaron Singer. 130-139 [doi]
• A polynomial lower bound on adaptive complexity of submodular maximizationWenzheng Li, Paul Liu, Jan Vondrák. 140-152 [doi]
• New algorithms and hardness for incremental single-source shortest paths in directed graphsMaximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein. 153-166 [doi]
• Fully-dynamic planarity testing in polylogarithmic timeJacob Holm, Eva Rotenberg. 167-180 [doi]
• Near-optimal fully dynamic densest subgraphSaurabh Sawlani, Junxing Wang. 181-193 [doi]
• Rounding dynamic matchings against an adaptive adversaryDavid Wajc. 194-207 [doi]
• Concentration on the Boolean hypercube via pathwise stochastic analysisRonen Eldan, Renan Gross. 208-221 [doi]
• AND testing and robust judgement aggregationYuval Filmus, Noam Lifshitz, Dor Minzer, Elchanan Mossel. 222-233 [doi]
• XOR lemmas for resilient functions against polynomialsEshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett, David Zuckerman. 234-246 [doi]
• Decision list compression by mild random restrictionsShachar Lovett, Kewen Wu 0001, Jiapeng Zhang. 247-254 [doi]
• One-shot signatures and applications to hybrid quantum/classical authenticationRyan Amos, Marios Georgiou 0001, Aggelos Kiayias, Mark Zhandry. 255-268 [doi]
• Post-quantum zero knowledge in constant roundsNir Bitansky, Omri Shmueli. 269-279 [doi]
• Better secret sharing via robust conditional disclosure of secretsBenny Applebaum, Amos Beimel, Oded Nir, Naty Peter. 280-293 [doi]
• Data structures meet cryptography: 3SUM with preprocessingAlexander Golovnev, Siyao Guo, Thibaut Horel, Sunoo Park, Vinod Vaikuntanathan. 294-307 [doi]
• Faster parallel algorithm for approximate shortest pathJason Li. 308-321 [doi]
• Parallel approximate undirected shortest paths via low hop emulatorsAlexandr Andoni, Clifford Stein, Peilin Zhong. 322-335 [doi]
• Efficient construction of directed hopsets and parallel approximate shortest pathsNairen Cao, Jeremy T. Fineman, Katina Russell. 336-349 [doi]
• Polylogarithmic-time deterministic network decomposition and distributed derandomizationVáclav Rozhon, Mohsen Ghaffari. 350-363 [doi]
• Walking randomly, massively, and efficientlyJakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski. 364-377 [doi]
• Classical algorithms, correlation decay, and complex zeros of partition functions of quantum many-body systemsAram Wettroth Harrow, Saeed Mehraban, Mehdi Soleimanifar. 378-386 [doi]
• Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learningNai-Hui Chia, András Gilyén, Tongyang Li, Han-Hsuan Lin, Ewin Tang, Chunhao Wang. 387-400 [doi]
• Bare quantum simultaneity versus classical interactivity in communication complexityDmitry Gavinsky. 401-411 [doi]
• Quadratic speedup for finding marked vertices by quantum walksAndris Ambainis, András Gilyén, Stacey Jeffery, Martins Kokainis. 412-424 [doi]
• The power of factorization mechanisms in local and central differential privacyAlexander Edmonds, Aleksandar Nikolov, Jonathan Ullman. 425-438 [doi]
• Private stochastic convex optimization: optimal rates in linear timeVitaly Feldman, Tomer Koren, Kunal Talwar. 439-449 [doi]
• Interaction is necessary for distributed learning with privacy or communication constraintsYuval Dagan, Vitaly Feldman. 450-462 [doi]
• Approximately stable committee selectionZhihao Jiang, Kamesh Munagala, Kangning Wang. 463-472 [doi]
• The Karger-Stein algorithm is optimal for k-cutAnupam Gupta, Euiwoong Lee, Jason Li. 473-484 [doi]
• A phase transition and a quadratic time unbiased estimator for network reliabilityDavid R. Karger. 485-495 [doi]
• Weighted min-cut: sequential, cut-query, and streaming algorithmsSagnik Mukhopadhyay, Danupon Nanongkai. 496-509 [doi]
• Explicit near-Ramanujan graphs of every degreeSidhanth Mohanty, Ryan O'Donnell, Pedro Paredes 0002. 510-523 [doi]
• Optimally resilient codes for list-decoding from insertions and deletionsVenkatesan Guruswami, Bernhard Haeupler, Amirbehshad Shahrasbi. 524-537 [doi]
• Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radiusChong Shangguan, Itzhak Tamo. 538-551 [doi]
• Arikan meets Shannon: polar codes with near-optimal convergence to channel capacityVenkatesan Guruswami, Andrii Riazanov, Min Ye. 552-564 [doi]
• Interactive error resilience beyond 2/7Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena. 565-578 [doi]
• Estimating normalizing constants for log-concave distributions: algorithms and lower boundsRong Ge 0001, Holden Lee, Jianfeng Lu. 579-586 [doi]
• Learning mixtures of linear regressions in subexponential time via Fourier momentsSitan Chen, Jerry Li 0001, Zhao Song. 587-600 [doi]
• Algorithms for heavy-tailed statistics: regression, covariance estimation, and beyondYeshwanth Cherapanamjeri, Samuel B. Hopkins, Tarun Kathuria, Prasad Raghavendra, Nilesh Tripuraneni. 601-609 [doi]
• Testing noisy linear functions for sparsityXue Chen 0001, Anindya De, Rocco A. Servedio. 610-623 [doi]
• Improved bounds for the sunflower lemmaRyan Alweiss, Shachar Lovett, Kewen Wu 0001, Jiapeng Zhang. 624-630 [doi]
• Improved bounds for perfect sampling of k-colorings in graphsSiddharth Bhandari, Sayantan Chakraborty 0002. 631-642 [doi]
• Approximating text-to-pattern Hamming distancesTimothy M. Chan, Shay Golan 0001, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat. 643-656 [doi]
• Does preprocessing help in fast sequence comparisons?Elazar Goldenberg, Aviad Rubinstein, Barna Saha. 657-670 [doi]
• Dynamic algorithms for LIS and distance to monotonicityMichael Mitzenmacher, Saeed Seddighin. 671-684 [doi]
• Constant-factor approximation of near-linear edit distance in near-linear timeJoshua Brakensiek, Aviad Rubinstein. 685-698 [doi]
• Constant factor approximations to edit distance on far input pairs in nearly linear timeMichal Koucký, Michael E. Saks. 699-712 [doi]
• Implementing geometric complexity theory: on the separation of orbit closures via symmetriesChristian Ikenmeyer, Umangathan Kandasamy. 713-726 [doi]
• The program-size complexity of self-assembled pathsPierre-Étienne Meunier, Damien Regnault, Damien Woods. 727-737 [doi]
• Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperaturesChristian Borgs, Jennifer T. Chayes, Tyler Helmuth, Will Perkins, Prasad Tetali. 738-751 [doi]
• Catalytic approaches to the tree evaluation problemJames Cook, Ian Mertz. 752-760 [doi]
• A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrixDaniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh. 761-774 [doi]
• Solving tall dense linear programs in nearly linear timeJan van den Brand, Yin Tat Lee, Aaron Sidford, Zhao Song. 775-788 [doi]
• Positive semidefinite programming: mixed, parallel, and width-independentArun Jambulapati, Yin Tat Lee, Jerry Li 0001, Swati Padmanabhan, Kevin Tian. 789-802 [doi]
• Faster energy maximization for faster maximum flowYang P. Liu, Aaron Sidford. 803-814 [doi]
• Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner treeJaroslaw Byrka, Fabrizio Grandoni 0001, Afrouz Jabal Ameli. 815-825 [doi]
• A spectral approach to network designLap Chi Lau, Hong Zhou. 826-839 [doi]
• Lifting sum-of-squares lower bounds: degree-2 to degree-4Sidhanth Mohanty, Prasad Raghavendra, Jeff Xu. 840-853 [doi]
• Fast sampling and counting k-SAT solutions in the local lemma regimeWeiming Feng, Heng Guo 0001, Yitong Yin, Chihao Zhang 0001. 854-867 [doi]
• Entanglement subvolume law for 2d frustration-free spin systemsAnurag Anshu, Itai Arad, David Gosset. 868-874 [doi]
• Interactive shallow Clifford circuits: quantum advantage against NC¹ and beyondDaniel Grier, Luke Schaeffer. 875-888 [doi]
• Computations with greater quantum depth are strictly more powerful (relative to an oracle)Matthew Coudron, Sanketh Menda. 889-901 [doi]
• On the need for large quantum depthNai-Hui Chia, Kai-Min Chung, Ching-Yi Lai. 902-915 [doi]
• The impossibility of efficient quantum weak coin flippingCarl A. Miller. 916-929 [doi]
• On the computability of continuous maximum entropy distributions with applicationsJonathan Leake, Nisheeth K. Vishnoi. 930-943 [doi]
• An improved cutting plane method for convex optimization, convex-concave games, and its applicationsHaotian Jiang, Yin Tat Lee, Zhao Song, Sam Chiu-wai Wong. 944-953 [doi]
• Does learning require memorization? a short tale about a long tailVitaly Feldman. 954-959 [doi]
• Efficiently learning structured distributions from untrusted batchesSitan Chen, Jerry Li 0001, Ankur Moitra. 960-973 [doi]
• All non-trivial variants of 3-LDT are equivalentBartlomiej Dudek 0001, Pawel Gawrychowski, Tatiana Starikovskaya. 974-981 [doi]
• Top-k-convolution and the quest for near-linear output-sensitive subset sumKarl Bringmann, Vasileios Nakos. 982-995 [doi]
• New hardness results for planar graph problems in p and an algorithm for sparsest cutAmir Abboud, Vincent Cohen-Addad, Philip N. Klein. 996-1009 [doi]
• Constant girth approximation for directed graphs in subquadratic timeShiri Chechik, Yang P. Liu, Omer Rotem, Aaron Sidford. 1010-1023 [doi]
• Non-signaling proofs with o(√ log n) provers are in PSPACEDhiraj Holden, Yael Tauman Kalai. 1024-1037 [doi]
• Unexpected hardness results for Kolmogorov complexity under uniform reductionsShuichi Hirahara. 1038-1051 [doi]
• Smoothed complexity of local max-cut and binary max-CSPXi Chen, Chenghao Guo, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Mihalis Yannakakis, Xinzhi Zhang. 1052-1065 [doi]
• How to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non-computableCristobal Rojas, Michael Yampolsky. 1066-1072 [doi]
• Separating the communication complexity of truthful and non-truthful combinatorial auctionsSepehr Assadi, Hrishikesh Khandeparkar, Raghuvansh R. Saxena, S. Matthew Weinberg. 1073-1085 [doi]
• On the Nisan-Ronen conjecture for submodular valuationsGeorge Christodoulou 0001, Elias Koutsoupias, Annamária Kovács. 1086-1096 [doi]
• Towards a better understanding of randomized greedy matchingZhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang 0001. 1097-1110 [doi]
• Stochastic matching with few queries: (1-ε) approximationSoheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi. 1111-1124 [doi]
• Caching with time windowsAnupam Gupta, Amit Kumar 0001, Debmalya Panigrahi. 1125-1138 [doi]
• Online vector balancing and geometric discrepancyNikhil Bansal, Haotian Jiang, Sahil Singla 0001, Makrand Sinha. 1139-1152 [doi]
• Online primal dual meets online matching with stochastic rewards: configuration LP to the rescueZhiyi Huang 0002, Qiankun Zhang. 1153-1164 [doi]
• Unbounded lower bound for k-server against weak adversariesMarcin Bienkowski, Jaroslaw Byrka, Christian Coester, Lukasz Jez. 1165-1169 [doi]
• Fooling Gaussian PTFs via local hyperconcentrationRyan O'Donnell, Rocco A. Servedio, Li-Yang Tan. 1170-1183 [doi]
• Extractors for adversarial sources via extremal hypergraphsEshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li. 1184-1197 [doi]
• Improved analysis of higher order random walks and applicationsVedat Levi Alev, Lap Chi Lau. 1198-1211 [doi]
• Strong self-concordance and samplingAditi Laddha, Yin Tat Lee, Santosh S. Vempala. 1212-1222 [doi]
• Separations and equivalences between turnstile streaming and linear sketchingJohn Kallaugher, Eric Price. 1223-1236 [doi]
• Exploration with limited memory: streaming algorithms for coin tossing, noisy comparisons, and multi-armed banditsSepehr Assadi, Chen Wang. 1237-1250 [doi]
• Non-adaptive adaptive sampling on turnstile streamsSepideh Mahabadi, Ilya P. Razenshteyn, David P. Woodruff, Samson Zhou. 1251-1264 [doi]
• Fast hashing with strong concentration boundsAnders Aamand, Jakob Bæk Tejs Knudsen, Mathias Bæk Tejs Knudsen, Peter Michael Reichstein Rasmussen, Mikkel Thorup. 1265-1278 [doi]
• Three-in-a-tree in near linear timeKai-Yuan Lai, Hsueh-I Lu, Mikkel Thorup. 1279-1292 [doi]
• Detecting and counting small patterns in planar graphs in subexponential parameterized timeJesper Nederlof. 1293-1306 [doi]
• An exponential time parameterized algorithm for planar disjoint pathsDaniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh 0001, Meirav Zehavi. 1307-1316 [doi]
• Hitting topological minors is FPTFedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi. 1317-1326 [doi]
• Strong average-case lower bounds from non-trivial derandomizationLijie Chen, Hanlin Ren. 1327-1334 [doi]
• Sharp threshold results for computational complexityLijie Chen, Ce Jin, R. Ryan Williams. 1335-1348 [doi]
• A robust version of Hegedus's lemma, with applicationsSrikanth Srinivasan 0001. 1349-1362 [doi]
• The one-way communication complexity of submodular maximization with applications to streaming and robustnessMoran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen. 1363-1374 [doi]
• Distance sensitivity oracles with subcubic preprocessing time and fast query timeShiri Chechik, Sarel Cohen. 1375-1388 [doi]
• Nearly optimal static Las Vegas succinct dictionaryHuacheng Yu. 1389-1401 [doi]
• Lower bound for succinct range minimum queryMingmou Liu, Huacheng Yu. 1402-1415 [doi]
• Coresets for clustering in Euclidean spaces: importance sampling is nearly optimalLingxiao Huang, Nisheeth K. Vishnoi. 1416-1429 [doi]