Table of Contents

• Graph Colouring Is Hard on Average for Polynomial Calculus and NullstellensatzJonas Conneryd, Susanna F. de Rezende, Jakob Nordström, Shuo Pang, Kilian Risse. 1-11 [doi]
• Clique Is Hard on Average for Unary Sherali-AdamsSusanna F. de Rezende, Aaron Potechin, Kilian Risse. 12-25 [doi]
• On Lifting Integrality Gaps to SSEH Hardness for Globally Constrained CSPsSuprovat Ghoshal, Euiwoong Lee. 26-36 [doi]
• On small-depth Frege proofs for PHPJohan Håstad. 37-49 [doi]
• Thin Trees for Laminar FamiliesNathan Klein, Neil Olver. 50-59 [doi]
• One Tree to Rule Them All: Poly-Logarithmic Universal Steiner TreeCostas Busch, Da Qi Chen, Arnold Filtser, Daniel Hathcock, D. Ellis Hershkowitz, Rajmohan Rajaraman. 60-76 [doi]
• Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω (log n) Lightness BarrierHung Le, Shay Solomon, Cuong Than. 77-97 [doi]
• Sub-quadratic (1+ϵ)-approximate Euclidean Spanners, with ApplicationsAlexandr Andoni, Hengjie Zhang. 98-112 [doi]
• Envy-Free Cake-Cutting for Four AgentsAlexandros Hollender, Aviad Rubinstein. 113-122 [doi]
• Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over TimeNeil Olver, Leon Sering, Laura Vargas Koch. 123-133 [doi]
• Simultaneous Auctions are Approximately Revenue-Optimal for Subadditive BiddersYang Cai 0001, Ziyun Chen, Jinzhao Wu. 134-147 [doi]
• Constant Approximation for Private Interdependent ValuationsAlon Eden, Michal Feldman, Kira Goldner, Simon Mauras, Divyarthi Mohan. 148-163 [doi]
• Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size AlphabetsZeyu Guo, Zihan Zhang. 164-176 [doi]
• A proof that Reed-Muller codes achieve Shannon capacity on symmetric channelsEmmanuel Abbe, Colin Sandon. 177-193 [doi]
• Gilbert and Varshamov Meet Johnson: List-Decoding Explicit Nearly-Optimal Binary CodesSilas Richelson, Sourya Roy. 194-205 [doi]
• Optimal Testing of Generalized Reed-Muller Codes in Fewer QueriesDor Minzer, Kai Zhe Zheng. 206-233 [doi]
• Separating MAX 2-AND, MAX DI-CUT and MAX CUTJoshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick. 234-252 [doi]
• Triplet Reconstruction and all other Phylogenetic CSPs are Approximation ResistantVaggos Chatziafratis, Konstantin Makarychev. 253-284 [doi]
• Improved Hardness of Approximating k-Clique under ETHBingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang. 285-306 [doi]
• Efficient Algorithms for Semirandom Planted CSPs at the Refutation ThresholdVenkatesan Guruswami, Jun-Ting Hsieh, Pravesh K. Kothari, Peter Manohar. 307-327 [doi]
• The minimal canonical form of a tensor networkArturo Acuaviva, Visu Makam, Harold Nieuwboer, David Pérez-García, Friedrich Sittner, Michael Walter 0005, Freek Witteveen. 328-362 [doi]
• Query-optimal estimation of unitary channels in diamond distanceJeongwan Haah, Robin Kothari, Ryan O'Donnell, Ewin Tang. 363-390 [doi]
• When Does Adaptivity Help for Quantum State Learning?Sitan Chen, Brice Huang, Jerry Li 0001, Allen Liu, Mark Sellke. 391-404 [doi]
• *Ryan Babbush, Dominic W. Berry, Robin Kothari, Rolando D. Somma, Nathan Wiebe. 405-414 [doi]
• Attribute-Based Encryption for Circuits of Unbounded Depth from LatticesYao Ching Hsieh, Huijia Lin, Ji Luo. 415-434 [doi]
• ABE for Circuits with poly (λ) -sized Keys from LWEValerio Cini, Hoeteck Wee. 435-446 [doi]
• Learning in Pessiland via Inductive InferenceShuichi Hirahara, Mikito Nanashima. 447-457 [doi]
• Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-AgreementMarshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass. 458-483 [doi]
• A Randomized Algorithm for Single-Source Shortest Path on Undirected Real-Weighted GraphsRan Duan, Jiayi Mao, Xinkai Shu, Longhui Yin. 484-492 [doi]
• Faster High Accuracy Multi-Commodity Flow from Single-Commodity TechniquesJan van den Brand, Daniel J. Zhang. 493-502 [doi]
• A Deterministic Almost-Linear Time Algorithm for Minimum-Cost FlowJan van den Brand, Li Chen 0028, Richard Peng, Rasmus Kyng, Yang P. Liu, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford. 503-514 [doi]
• Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!Karl Bringmann, Alejandro Cassis, Nick Fischer. 515-538 [doi]
• Advisor-Verifier-Prover Games and the Hardness of Information Theoretic CryptographyBenny Applebaum, Oded Nir. 539-555 [doi]
• On Pseudolinear Codes for Correcting Adversarial ErrorsEric Ruzomberka, Homa Nikbakht, Christopher G. Brinton, H. Vincent Poor. 556-567 [doi]
• A New Approach to Post-Quantum Non-MalleabilityXiao Liang 0014, Omkant Pandey, Takashi Yamakawa. 568-579 [doi]
• Towards Separating Computational and Statistical Differential PrivacyBadih Ghazi, Rahul Ilango, Pritish Kamath, Ravi Kumar 0001, Pasin Manurangsi. 580-599 [doi]
• Bridge Girth: A Unifying Notion in Network DesignGreg Bodwin, Gary Hoppenworth, Ohad Trabelsi. 600-648 [doi]
• Planar Disjoint Paths, Treewidth, and KernelsMichal Wlodarczyk 0001, Meirav Zehavi. 649-662 [doi]
• Flip-width: Cops and Robber on dense graphsSzymon Torunczyk. 663-700 [doi]
• Folklore Sampling is Optimal for Exact Hopsets: Confirming the √n BarrierGreg Bodwin, Gary Hoppenworth. 701-720 [doi]
• Fourier Growth of Communication Protocols for XOR FunctionsUma Girish, Makrand Sinha, Avishay Tal, Kewen Wu 0001. 721-732 [doi]
• SAT Reduces to the Minimum Circuit Size Problem with a Random OracleRahul Ilango. 733-742 [doi]
• Doubley-Efficient Interactive Proofs for Distribution PropertiesTal Herman, Guy N. Rothblum. 743-751 [doi]
• IOPs with Inverse Polynomial Soundness ErrorGal Arnon, Alessandro Chiesa, Eylon Yogev. 752-761 [doi]
• Lipschitz Continuous Algorithms for Graph ProblemsSoh Kumabe, Yuichi Yoshida. 762-797 [doi]
• Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman RefinementsMartin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer. 798-809 [doi]
• Strong Spatial Mixing for Colorings on Trees and its Algorithmic ApplicationsZongchen Chen, Kuikui Liu, Nitya Mani, Ankur Moitra. 810-845 [doi]
• Singular Value Approximation and Sparsifying Random Walks on Directed GraphsAmirMahdi Ahmadinejad, John Peebles, Edward Pyne, Aaron Sidford, Salil P. Vadhan. 846-854 [doi]
• Improved Streaming Algorithms for Maximum Directed Cut via Smoothed SnapshotsRaghuvansh R. Saxena, Noah G. Singer, Madhu Sudan 0001, Santhoshini Velusamy. 855-870 [doi]
• Streaming Lower Bounds and Asymmetric Set-DisjointnessShachar Lovett, Jiapeng Zhang. 871-882 [doi]
• Streaming Euclidean k-median and k-means with o(log n) SpaceVincent Cohen-Addad, David P. Woodruff, Samson Zhou. 883-908 [doi]
• Hidden Permutations to the Rescue: Multi-Pass Streaming Lower Bounds for Approximate MatchingsSepehr Assadi, Janani Sundaresan. 909-932 [doi]
• Strong Bounds for 3-ProgressionsZander Kelley, Raghu Meka. 933-973 [doi]
• The Subspace Flatness Conjecture and Faster Integer ProgrammingVictor Reis, Thomas Rothvoss. 974-988 [doi]
• Certified Hardness vs. Randomness for Log-SpaceEdward Pyne, Ran Raz, Wei Zhan. 989-1007 [doi]
• Derandomization vs Refutation: A Unified Framework for Characterizing DerandomizationLijie Chen 0001, Roei Tell, Ryan Williams 0001. 1008-1047 [doi]
• Top-Down Lower Bounds for Depth-Four CircuitsMika Göös, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov 0001. 1048-1055 [doi]
• Toward Better Depth Lower Bounds: A KRW-like theorem for Strong CompositionOr Meir. 1056-1081 [doi]
• Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation ClusteringVincent Cohen-Addad, Euiwoong Lee, Shi Li 0001, Alantha Newman. 1082-1104 [doi]
• Deterministic Clustering in High Dimensional Spaces: Sketches and ApproximationVincent Cohen-Addad, David Saulpic, Chris Schwiegelshohn. 1105-1130 [doi]
• The Price of Explainability for ClusteringAnupam Gupta 0001, Madhusudhan Reddy Pittu, Ola Svensson, Rachel Yuan. 1131-1148 [doi]
• Agnostic proper learning of monotone functions: beyond the black-box correction barrierJane Lange, Arsen Vasilyan. 1149-1170 [doi]
• Near Optimal Memory-Regret Tradeoff for Online LearningBinghui Peng, Aviad Rubinstein. 1171-1194 [doi]
• Tight Time-Space Lower Bounds for Constant-Pass LearningXin Lyu 0002, Avishay Tal, Hongxun Wu, Junzhao Yang. 1195-1202 [doi]
• Optimal PAC Bounds without Uniform ConvergenceIshaq Aden-Ali, Yeshwanth Cherapanamjeri, Abhishek Shetty, Nikita Zhivotovskiy. 1203-1223 [doi]
• Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and ShortcuttingLijie Chen 0001, William M. Hoza, Xin Lyu 0002, Avishay Tal, Hongxun Wu. 1224-1239 [doi]
• Explicit orthogonal and unitary designsRyan O'Donnell, Rocco A. Servedio, Pedro Paredes 0002. 1240-1260 [doi]
• Polynomial-Time Pseudodeterministic Construction of PrimesLijie Chen 0001, Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam. 1261-1270 [doi]
• Two Source Extractors for Asymptotically Optimal Entropy, and (Many) MoreXin Li. 1271-1281 [doi]
• Traversing combinatorial 0/1-polytopes via optimizationArturo I. Merino, Torsten Mütze. 1282-1291 [doi]
• The Vector Balancing Constant for ZonotopesRainie Bozzai, Victor Reis, Thomas Rothvoss. 1292-1300 [doi]
• A deterministic near-linear time approximation scheme for geometric transportationEmily Fox, Jiashuai Lu. 1301-1315 [doi]
• Computing linear sections of varieties: quantum entanglement, tensor decompositions and beyondNathaniel Johnston, Benjamin Lovitz, Aravindan Vijayaraghavan. 1316-1336 [doi]
• Parallel Repetition for the GHZ Game: Exponential DecayMark Braverman, Subhash Khot, Dor Minzer. 1337-1341 [doi]
• Bounding the Quantum Value of Compiled Nonlocal Games: From CHSH to BQP VerificationAnand Natarajan, Tina Zhang. 1342-1348 [doi]
• stateQIP = statePSPACETony Metger, Henry Yuen. 1349-1356 [doi]
• Constant-Factor Approximation Algorithms for Convex Cover and Hidden Set in a Simple PolygonReilly Browne, Prahlad Narasimhan Kasthurirangan, Joseph S. B. Mitchell, Valentin Polishchuk. 1357-1365 [doi]
• Improved Approximations for Vector Bin Packing via Iterative Randomized RoundingAriel Kulik, Matthias Mnich, Hadas Shachnai. 1366-1376 [doi]
• Parameterized Approximation Schemes for Clustering with General Norm ObjectivesFateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase. 1377-1399 [doi]
• Memory-Query Tradeoffs for Randomized Convex OptimizationXi Chen, Binghui Peng. 1400-1413 [doi]
• Quartic Samples Suffice for Fourier InterpolationZhao Song 0002, Baocheng Sun 0002, Omri Weinstein, Ruizhe Zhang 0001. 1414-1425 [doi]
• Fast Numerical Multivariate Multipoint EvaluationSumanta Ghosh, Prahladh Harsha, Simao Herdade, Mrinal Kumar 0001, Ramprasad Saptharishi. 1426-1439 [doi]
• Locally Uniform HashingIoana O. Bercea, Lorenzo Beretta 0001, Jonas Klausen, Jakob Bæk Tejs Houen, Mikkel Thorup. 1440-1470 [doi]
• Generalizations of Matrix Multiplication can solve the Light Bulb ProblemJosh Alman, Hengjie Zhang. 1471-1495 [doi]
• Tight Space Lower Bound for Pseudo-Deterministic Approximate CountingOfer Grossman, Meghal Gupta, Mark Sellke. 1496-1504 [doi]
• Extracting Randomness from Samplable Distributions, RevisitedMarshall Ball, Eli Goldin, Dana Dachman-Soled, Saachi Mutreja. 1505-1514 [doi]
• Pseudorandom Hashing for Space-bounded Computation with Applications in StreamingPraneeth Kacham, Rasmus Pagh, Mikkel Thorup, David P. Woodruff. 1515-1550 [doi]
• Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise IndependenceMohsen Ghaffari 0001, Christoph Grunau, Václav Rozhon. 1551-1562 [doi]
• Dynamic (1+ϵ)-Approximate Matching Size in Truly Sublinear Update TimeSayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak. 1563-1588 [doi]
• Super-Logarithmic Lower Bounds for Dynamic Graph ProblemsKasper Green Larsen, Huacheng Yu. 1589-1604 [doi]
• The Complexity of Dynamic Least-Squares RegressionShunhua Jiang, Binghui Peng, Omri Weinstein. 1605-1627 [doi]
• Approximating Edit Distance in the Fully Dynamic ModelTomasz Kociumaka, Anish Mukherjee 0001, Barna Saha. 1628-1638 [doi]
• From Grassmannian to Simplicial High-Dimensional ExpandersLouis Golowich. 1639-1648 [doi]
• HDX CondensersItay Cohen 0003, Roy Roth, Amnon Ta-Shma. 1649-1664 [doi]
• Optimal mixing of the down-up walk on independent sets of a given sizeVishesh Jain, Marcus Michelen, Huy Tuan Pham, Thuy Duong Vuong. 1665-1681 [doi]
• List Decoding of Tanner and Expander Amplified Codes from Distance CertificatesFernando Granha Jeronimo, Shashank Srivastava, Madhur Tulsiani. 1682-1693 [doi]
• Chasing Positive BodiesSayan Bhattacharya, Niv Buchbinder, Roie Levin, Thatchaphol Saranurak. 1694-1714 [doi]
• Dynamic "Succincter"Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou. 1715-1733 [doi]
• Dynamic treewidthTuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski 0001. 1734-1744 [doi]
• Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius FormAdam Karczmarz, Piotr Sankowski. 1745-1756 [doi]
• A strong composition theorem for junta complexity and the boosting of property testersGuy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan. 1757-1777 [doi]
• New Lower Bounds for Adaptive Tolerant Junta TestingXi Chen, Shyamal Patel. 1778-1786 [doi]
• Testing Graph Properties with the Container MethodEric Blais, Cameron Seth. 1787-1795 [doi]
• 1/2+o(1) Monotonicity Tester for Boolean Functions on d-Dimensional HypergridsHadley Black, Deeparnab Chakrabarty, C. Seshadhri 0001. 1796-1821 [doi]
• Strongly History-Independent Storage Allocation: New Upper and Lower BoundsWilliam Kuszmaul. 1822-1841 [doi]
• Tight Cell-Probe Lower Bounds for Dynamic Succinct DictionariesTianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou. 1842-1862 [doi]
• Online Ordinal Problems: Optimality of Comparison-based Algorithms and their Cardinal ComplexityNick Gravin, Enze Sun, Zhihao Gavin Tang. 1863-1876 [doi]
• Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed SpaceDominik Kempa, Tomasz Kociumaka. 1877-1886 [doi]
• Canonical decompositions of 3-connected graphsJohannes Carmesin, Jan Kurkofka. 1887-1920 [doi]
• Proof of the Clustered Hadwiger ConjectureVida Dujmovic, Louis Esperet, Pat Morin, David R. Wood. 1921-1930 [doi]
• 2/3 HyperplanesOhad Klein. 1931-1936 [doi]
• Directed Acyclic Outerplanar Graphs Have Constant Stack NumberPaul Jungeblut, Laura Merker, Torsten Ueckerdt. 1937-1952 [doi]
• Sparsifying Sums of NormsArun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford. 1953-1962 [doi]
• Towards derandomising Markov chain Monte CarloWeiming Feng 0001, Heng Guo 0001, Chunyang Wang, Jiaheng Wang 0002, Yitong Yin. 1963-1990 [doi]
• Uniqueness and Rapid Mixing in the Bipartite Hardcore Model (extended abstract)Xiaoyu Chen, Jingcheng Liu 0005, Yitong Yin. 1991-2005 [doi]
• Sampling from the Potts model at low temperatures via Swendsen-Wang dynamicsAntonio Blanca, Reza Gheissari. 2006-2020 [doi]
• Interior-point methods on manifolds: theory and applicationsHiroshi Hirai 0001, Harold Nieuwboer, Michael Walter 0005. 2021-2030 [doi]
• ReSQueing Parallel and Private Stochastic Convex OptimizationYair Carmon, Arun Jambulapati, Yujia Jin, Yin Tat Lee, Daogao Liu, Aaron Sidford, Kevin Tian. 2031-2058 [doi]
• The Bit Complexity of Efficient Continuous OptimizationMehrdad Ghadiri, Richard Peng, Santosh S. Vempala. 2059-2070 [doi]
• Sparse Submodular Function MinimizationAndrei Graur, Haotian Jiang, Aaron Sidford. 2071-2080 [doi]
• On Symmetric Factorizations of Hankel MatricesMehrdad Ghadiri. 2081-2092 [doi]
• Krylov Methods are (nearly) Optimal for Low-Rank ApproximationAinesh Bakshi, Shyam Narayanan. 2093-2101 [doi]
• Matrix Completion in Almost-Verification TimeJonathan A. Kelner, Jerry Li 0001, Allen Liu, Aaron Sidford, Kevin Tian. 2102-2128 [doi]
• Faster Matrix Multiplication via Asymmetric HashingRan Duan, Hongxun Wu, Renfei Zhou. 2129-2138 [doi]
• Query lower bounds for log-concave samplingSinho Chewi, Jaume de Dios Pont, Jerry Li 0001, Chen Lu 0002, Shyam Narayanan. 2139-2148 [doi]
• Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs: The Case of Extra TrianglesGuy Bresler, Chenghao Guo, Yury Polyanskiy. 2149-2158 [doi]
• The Full Landscape of Robust Mean Testing: Sharp Separations between Oblivious and Adaptive ContaminationClément L. Canonne, Samuel B. Hopkins, Jerry Li 0001, Allen Liu, Shyam Narayanan. 2159-2168 [doi]
• Faster high-accuracy log-concave sampling via algorithmic warm startsJason M. Altschuler, Sinho Chewi. 2169-2176 [doi]
• Optimal Algorithms for Bounded Weighted Edit DistanceAlejandro Cassis, Tomasz Kociumaka, Philip Wellnitz. 2177-2187 [doi]
• Faster Algorithms for Text-to-Pattern Hamming DistancesTimothy M. Chan, Ce Jin 0001, Virginia Vassilevska Williams, Yinzhan Xu. 2188-2203 [doi]
• All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear TimeAmir Abboud, Jason Li 0006, Debmalya Panigrahi, Thatchaphol Saranurak. 2204-2212 [doi]
• Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms!Divesh Aggarwal, Rajendra Kumar 0002. 2213-2230 [doi]
• Covering Planar Metrics (and Beyond): O(1) Trees SufficeHsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than. 2231-2261 [doi]
• Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1Vincent Cohen-Addad, Hung Le, Marcin Pilipczuk, Michal Pilipczuk. 2262-2277 [doi]
• Path-Reporting Distance Oracles with Logarithmic Stretch and Size O(n log log n)Michael Elkin, Idan Shabat. 2278-2311 [doi]
• Deterministic Fully Dynamic SSSP and MoreJan van den Brand, Adam Karczmarz. 2312-2321 [doi]
• Local Computation Algorithms for Maximum Matching: New Lower BoundsSoheil Behnezhad, Mohammad Roghani, Aviad Rubinstein. 2322-2335 [doi]
• Secure Computation Meets Distributed Universal OptimalityMerav Parter. 2336-2368 [doi]
• Distribution of the threshold for the symmetric perceptronAshwin Sah, Mehtaab Sawhney. 2369-2382 [doi]
• Properly learning decision trees with queries is NP-hardCaleb Koch, Carmen Strassle, Li-Yang Tan. 2383-2407 [doi]
• Beyond Moments: Robustly Learning Affine Transformations with Asymptotically Optimal ErrorHe Jia, Pravesh K. Kothari, Santosh S. Vempala. 2408-2429 [doi]
• Stability and Replicability in LearningZachary Chase 0001, Shay Moran, Amir Yehudayoff. 2430-2439 [doi]