Table of Contents

• Replicability in High Dimensional StatisticsMax Hopkins, Russell Impagliazzo, Daniel M. Kane, Sihan Liu, Christopher Ye 0001. 1-8 [doi]
• Distinguishing, Predicting, and Certifying: On the Long Reach of Partial Notions of PseudorandomnessJiatu Li, Edward Pyne, Roei Tell. 1-13 [doi]
• Cycles of Well-Linked Sets and an Elementary Bound for the Directed Grid TheoremMeike Hatzel, Stephan Kreutzer, Marcelo Garlet Milani, Irene Muzi. 1-20 [doi]
• First-Order Model Checking on Monadically Stable Graph ClassesJan Dreier, Ioannis Eleftheriadis, Nikolas Mählmann, Rose McCarty, Michal Pilipczuk, Szymon Torunczyk. 21-30 [doi]
• Obstructions to Erdös-Pósa Dualities for MinorsChristophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht. 31-52 [doi]
• Minor Containment and Disjoint Paths in Almost-Linear TimeTuukka Korhonen, Michal Pilipczuk, Giannos Stamoulis. 53-61 [doi]
• Computing the 3-Edge-Connected Components of Directed Graphs in Linear TimeLoukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas. 62-85 [doi]
• Three-Edge-Coloring Projective Planar Cubic Graphs: A Generalization of the Four Color TheoremYuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Tomohiro Sonobe. 86-105 [doi]
• O(1) Insertion for Random Walk d-ary Cuckoo Hashing up to the Load ThresholdTolson Bell, Alan M. Frieze. 106-119 [doi]
• Fast Mixing in Sparse Random Ising ModelsKuikui Liu, Sidhanth Mohanty, Amit Rajaraman, David X. Wu. 120-128 [doi]
• A Sampling Lovász Local Lemma for Large Domain SizesChunyang Wang, Yitong Yin. 129-150 [doi]
• Sampling, Counting, and Large Deviations for Triangle-Free Graphs Near the Critical DensityMatthew Jenssen, Will Perkins 0001, Aditya Potukuchi, Michael Simkin. 151-165 [doi]
• Computational Dynamical SystemsJordan Cotler, Semon Rezchikov. 166-202 [doi]
• Locally Stationary Distributions: A Framework for Analyzing Slow-Mixing Markov ChainsKuikui Liu, Sidhanth Mohanty, Prasad Raghavendra, Amit Rajaraman, David X. Wu. 203-215 [doi]
• Fully Dynamic k-Clustering with Fast Update Time and Small RecourseSayan Bhattacharya, Martín Costa, Naveen Garg, Silvio Lattanzi, Nikos Parotsidis. 216-227 [doi]
• On Approximate Fully-Dynamic Matching and Online Matrix-Vector MultiplicationYang P. Liu. 228-243 [doi]
• Predict to Minimize Swap Regret for All Payoff-Bounded TasksLunjia Hu, Yifan Wu. 244-263 [doi]
• A Lossless Deamortization for Dynamic Greedy Set CoverShay Solomon, Amitai Uzrad, Tianyi Zhang. 264-290 [doi]
• The Online Submodular Assignment ProblemDaniel Hathcock, Billy Jin, Kalen Patton, Sherry Sarkar, Michael Zlatin. 291-313 [doi]
• Fully Dynamic Matching and Ordered Ruzsa-Szemerédi GraphsSoheil Behnezhad, Alma Ghafari. 314-327 [doi]
• Fast List Decoding of Univariate Multiplicity and Folded Reed-Solomon CodesRohan Goyal, Prahladh Harsha, Mrinal Kumar 0001, Ashutosh Shankar. 328-343 [doi]
• Decoding Quasi-Cyclic Quantum LDPC CodesLouis Golowich, Venkatesan Guruswami. 344-368 [doi]
• Optimal Coding for Randomized Kolmogorov Complexity and Its ApplicationsShuichi Hirahara, Zhenjian Lu, Mikito Nanashima. 369-378 [doi]
• Expansion of High-Dimensional Cubical Complexes: with Application to Quantum Locally Testable CodesIrit Dinur, Ting-Chun Lin, Thomas Vidick. 379-385 [doi]
• Communication Separations for Truthful Auctions: Breaking the Two-Player BarrierShiri Ron, Clayton Thomas, S. Matthew Weinberg, Qianfan Zhang 0002. 386-405 [doi]
• On Pigeonhole Principles and Ramsey in TFNPSiddhartha Jain 0002, Jiawei Li, Robert Robere, Zhiyang Xun. 406-428 [doi]
• An XOR Lemma for Deterministic Communication ComplexitySiddharth Iyer, Anup Rao 0001. 429-432 [doi]
• The Communication Complexity of Approximating Matrix RankAlexander A. Sherstov, Andrey A. Storozhenko. 433-462 [doi]
• Efficient Approximate Unitary Designs from Random Pauli RotationsJeongwan Haah, Yunchao Liu, Xinyu Tan. 463-475 [doi]
• Efficient Unitary Designs from Random Sums and PermutationsChi-Fang Chen, Jordan Docter, Michelle Xu, Adam Bouland, Fernando G. S. L. Brandão, Patrick Hayden. 476-484 [doi]
• Simple Constructions of Linear-Depth t-Designs and Pseudorandom UnitariesTony Metger, Alexander Poremba, Makrand Sinha, Henry Yuen. 485-492 [doi]
• Gapped Clique Homology on Weighted Graphs is QMA1-Hard and Contained in QMARobbie King, Tamara Kohler. 493-504 [doi]
• Reverse Mathematics of Complexity Lower BoundsLijie Chen 0001, Jiatu Li, Igor C. Oliveira. 505-527 [doi]
• Interactive Proofs for General Distribution PropertiesTal Herman, Guy N. Rothblum. 528-538 [doi]
• Trading Determinism for Noncommutativity in Edmonds' ProblemVikraman Arvind, Abhranil Chatterjee 0001, Partha Mukhopadhyay. 539-559 [doi]
• P vs PSpace Dichotomy for the Quantified Constraint Satisfaction ProblemDmitriy Zhuk. 560-572 [doi]
• Jump Operators, Interactive Proofs and Proof Complexity GeneratorsErfan Khaniki. 573-593 [doi]
• Optimal Bounds for Open Addressing Without ReorderingMartín Farach-Colton, Andrew Krapivin, William Kuszmaul. 594-605 [doi]
• Tight Analyses of Ordered and Unordered Linear ProbingMark Braverman, William Kuszmaul. 606-635 [doi]
• Tight Bounds for Classical Open AddressingMichael A. Bender, William Kuszmaul, Renfei Zhou. 636-657 [doi]
• Instance-Optimality in I/O-Efficient Sampling and Sequential EstimationShyam Narayanan, Václav Rozhon, Jakub Tetek, Mikkel Thorup. 658-688 [doi]
• An Optimal Algorithm for Sorting Pattern-Avoiding SequencesMichal Opler. 689-699 [doi]
• Deterministic Algorithm and Faster Algorithm for Submodular Maximization Subject to a Matroid ConstraintNiv Buchbinder, Moran Feldman. 700-712 [doi]
• On Approximating Cutwidth and PathwidthNikhil Bansal 0001, Dor Katzelnick, Roy Schwartz 0002. 713-729 [doi]
• The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller Than 2Jaroslaw Byrka, Fabrizio Grandoni 0001, Vera Traub. 730-753 [doi]
• Efficient Approximation of Fractional Hypertree WidthViktoriia Korchemna, Daniel Lokshtanov, Saket Saurabh 0001, Vaishali Surianarayanan, Jie Xue 0003. 754-779 [doi]
• Canonical Forms for Matrix Tuples in Polynomial TimeYouming Qiao, Xiaorui Sun. 780-789 [doi]
• Polynomial Calculus Sizes Over the Boolean and Fourier Bases are IncomparableSasank Mouli. 790-796 [doi]
• A Dense Model Theorem for the Boolean SliceGil Kalai, Noam Lifshitz, Dor Minzer, Tamar Ziegler. 797-805 [doi]
• Dot-Product Proofs and Their ApplicationsNir Bitansky, Prahladh Harsha, Yuval Ishai, Ron D. Rothblum, David J. Wu 0001. 806-825 [doi]
• Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXsYotam Dikstein, Irit Dinur, Alexander Lubotzky. 826-861 [doi]
• Constant Degree Direct Product Testers with Small SoundnessMitali Bafna, Noam Lifshitz, Dor Minzer. 862-869 [doi]
• Chernoff Bounds and Reverse Hypercontractivity on HDXYotam Dikstein, Max Hopkins. 870-919 [doi]
• Approximation Algorithms for Noncommutative CSPsEric Culf, Hamoon Mousavi, Taro Spirig. 920-929 [doi]
• Certifying Euclidean Sections and Finding Planted Sparse Vectors Beyond the √n Dimension ThresholdVenkatesan Guruswami, Jun-Ting Hsieh, Prasad Raghavendra. 930-948 [doi]
• Sum-of-Squares Lower Bounds for Non-Gaussian Component AnalysisIlias Diakonikolas, Sushrut Karmalkar, Shuo Pang, Aaron Potechin. 949-958 [doi]
• Semirandom Planted Clique and the Restricted Isometry PropertyJaroslaw Blasiok, Rares-Darius Buhai, Pravesh K. Kothari, David Steurer. 959-969 [doi]
• Efficient Certificates of Anti-Concentration Beyond GaussiansAinesh Bakshi, Pravesh K. Kothari, Goutham Rajendran, Madhur Tulsiani, Aravindan Vijayaraghavan. 970-987 [doi]
• Efficient Statistics With Unknown Truncation, Polynomial Time Algorithms, Beyond GaussiansJane H. Lee, Anay Mehrotra, Manolis Zampetakis. 988-1006 [doi]
• Tensor Cumulants for Statistical Inference on Invariant DistributionsDmitriy Kunisky, Cristopher Moore, Alexander S. Wein. 1007-1026 [doi]
• High-Temperature Gibbs States are Unentangled and Efficiently PreparableAinesh Bakshi, Allen Liu, Ankur Moitra, Ewin Tang. 1027-1036 [doi]
• Structure Learning of Hamiltonians from Real-Time EvolutionAinesh Bakshi, Allen Liu, Ankur Moitra, Ewin Tang. 1037-1050 [doi]
• Quantum Eigenvalue ProcessingGuang Hao Low, Yuan Su. 1051-1062 [doi]
• Quantum Computational Advantage with Constant-Temperature Gibbs SamplingThiago Bergamaschi, Chi-Fang Chen, Yunchao Liu. 1063-1085 [doi]
• Optimal Tradeoffs for Estimating Pauli ObservablesSitan Chen, Weiyuan Gong, Qi Ye. 1086-1105 [doi]
• A Computational Test of Contextuality and, Even Simpler Proofs of QuantumnessAtul Singh Arora, Kishor Bharti, Alexandru Cojocaru, Andrea Coladangelo. 1106-1125 [doi]
• Capacity Threshold for the Ising PerceptronBrice Huang. 1126-1136 [doi]
• Optimal Quantile Estimation: Beyond the Comparison ModelMeghal Gupta, Mihir Singhal, Hongxun Wu. 1137-1158 [doi]
• Proofs of Space with Maximal HardnessLeonid Reyzin. 1159-1177 [doi]
• Commitments are Equivalent to Statistically-Verifiable One-Way State GeneratorsRishabh Batra, Rahul Jain 0001. 1178-1192 [doi]
• Succinct Arguments for QMA from Standard Assumptions via Compiled Nonlocal GamesTony Metger, Anand Natarajan, Tina Zhang. 1193-1201 [doi]
• Certifying Almost All Quantum States with Few Single-Qubit MeasurementsHsin-Yuan Huang, John Preskill, Mehdi Soleimanifar. 1202-1206 [doi]
• How to Simulate Random Oracles with Auxiliary InputYevgeniy Dodis, Aayush Jain, Huijia Lin, Ji Luo 0002, Daniel Wichs. 1207-1230 [doi]
• Online Combinatorial Allocations and Auctions with Few SamplesPaul Dütting, Thomas Kesselheim, Brendan Lucier, Rebecca Reiffenhäuser, Sahil Singla 0001. 1231-1250 [doi]
• Benchmark-Tight Approximation Ratio of Simple Mechanism for a Unit-Demand BuyerYaonan Jin, Pinyan Lu. 1251-1259 [doi]
• Semi-Bandit Learning for Monotone Stochastic OptimizationArpit Agarwal, Rohan Ghuge, Viswanath Nagarajan. 1260-1274 [doi]
• On Robustness to k-Wise Independence of Optimal Bayesian MechanismsNick Gravin, Zhiqi Wang. 1275-1293 [doi]
• Hardness of Approximate Sperner and Applications to Envy-Free Cake CuttingRuiquan Gao 0001, Mohammad Roghani, Aviad Rubinstein, Amin Saberi. 1294-1331 [doi]
• The Tractability Border of Reachability in Simple Vector Addition Systems with StatesDmitry Chistikov 0001, Wojciech Czerwinski, Filip Mazowiecki, Lukasz Orlikowski, Henry Sinclair-Banks, Karol Wegrzycki. 1332-1354 [doi]
• Hardness of Packing, Covering and Partitioning Simple Polygons with Unit SquaresMikkel Abrahamsen, Jack Stade. 1355-1371 [doi]
• The Orthogonal Vectors Conjecture and Non-Uniform Circuit Lower BoundsRyan Williams. 1372-1387 [doi]
• Strong vs. Weak Range Avoidance and the Linear Ordering PrincipleOliver Korten, Toniann Pitassi. 1388-1407 [doi]
• Faster Isomorphism Testing of p-Groups of Frattini Class 2Gábor Ivanyos, Euan J. Mendoza, Youming Qiao, Xiaorui Sun, Chuanqi Zhang. 1408-1424 [doi]
• Boosting Uniformity in Quasirandom Groups: Fast and SimpleHarm Derksen, Chin Ho Lee, Emanuele Viola. 1425-1430 [doi]
• The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore TheoremGuy Blanc, Alexandre Hayderi, Caleb Koch 0001, Li-Yang Tan. 1431-1450 [doi]
• On the Existence of Seedless Condensers: Exploring the TerrainEshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach. 1451-1469 [doi]
• Tight Bounds for the Zig-Zag ProductGil Cohen, Itay Cohen 0003, Gal Maor. 1470-1499 [doi]
• Improved Condensers for Chor-Goldreich SourcesJesse Goodman, Xin Li 0006, David Zuckerman. 1513-1549 [doi]
• Improved Distance (Sensitivity) Oracles with Subquadratic SpaceDavide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich 0001, Martin Schirneck. 1550-1558 [doi]
• Sparse Graph Counting and Kelley-Meka Bounds for Binary SystemsYuval Filmus, Hamed Hatami, Kaave Hosseini, Esty Kelman. 1559-1578 [doi]
• Towards Instance-Optimal Euclidean SpannersHung Le 0001, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang. 1579-1609 [doi]
• Sensitivity, Proximity and FPT Algorithms for Exact Matroid ProblemsFriedrich Eisenbrand, Lars Rohwedder, Karol Wegrzycki. 1610-1620 [doi]
• Computational Hardness of Detecting Graph Lifts and Certifying Lift-Monotone Properties of Random Regular GraphsDmitriy Kunisky, Xifan Yu. 1621-1633 [doi]
• New Structures and Algorithms for Length-Constrained Expander DecompositionsBernhard Haeupler, D. Ellis Hershkowitz, Zihan Tan. 1634-1645 [doi]
• Computing Approximate Centerpoints in Polynomial TimeYeshwanth Cherapanamjeri. 1654-1668 [doi]
• Near-Optimal Size Linear Sketches for Hypergraph Cut SparsifiersSanjeev Khanna, Aaron Putterman, Madhu Sudan 0001. 1669-1706 [doi]
• Sensitivity Sampling for k-Means: Worst Case and Stability Optimal Coreset BoundsNikhil Bansal 0001, Vincent Cohen-Addad, Milind Prabhu, David Saulpic, Chris Schwiegelshohn. 1707-1723 [doi]
• Novel Properties of Hierarchical Probabilistic Partitions and Their Algorithmic ApplicationsSandip Banerjee, Yair Bartal, Lee-Ad Gottlieb, Alon Hovav. 1724-1767 [doi]
• Spectral Guarantees for Adversarial Streaming PCAEric Price 0001, Zhiyang Xun. 1768-1785 [doi]
• A Stronger Bound for Linear 3-LCCTal Yankovitz. 1786-1801 [doi]
• Exponential Lower Bounds for Smooth 3-LCCs and Sharp Bounds for DesignsPravesh K. Kothari, Peter Manohar. 1802-1845 [doi]
• Random Gabidulin Codes Achieve List Decoding Capacity in the Rank MetricZeyu Guo 0001, Chaoping Xing, Chen Yuan 0003, Zihan Zhang. 1846-1873 [doi]
• Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow CyclesOmar Alrabiah, Venkatesan Guruswami. 1874-1882 [doi]
• An Improved Line-Point Low-Degree TestPrahladh Harsha, Mrinal Kumar 0001, Ramprasad Saptharishi, Madhu Sudan 0001. 1883-1892 [doi]
• Fast Decision Tree Learning Solves Hard Coding-Theoretic ProblemsCaleb Koch 0001, Carmen Strassle, Li-Yang Tan. 1893-1910 [doi]
• Gaussian Approximation of Convex Sets by Intersections of HalfspacesAnindya De, Shivam Nadimpalli, Rocco A. Servedio. 1911-1930 [doi]
• Agnostically Learning Multi-Index Models with QueriesIlias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis. 1931-1952 [doi]
• Exploration is Harder than Prediction: Cryptographically Separating Reinforcement Learning from Supervised LearningNoah Golowich, Ankur Moitra, Dhruv Rohatgi. 1953-1967 [doi]
• Revisiting Agnostic PAC LearningSteve Hanneke, Kasper Green Larsen, Nikita Zhivotovskiy. 1968-1982 [doi]
• Ramsey Theorems for Trees and a General 'Private Learning Implies Online Learning' TheoremSimone Fioravanti, Steve Hanneke, Shay Moran, Hilla Schefler, Iska Tsubari. 1983-2009 [doi]
• Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via DualityJan van den Brand, Li Chen 0028, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg, Sushant Sachdeva. 2010-2032 [doi]
• ε Worst-Case Update TimeBernhard Haeupler, Yaowei Long, Thatchaphol Saranurak. 2033-2044 [doi]
• Lempel-Ziv (LZ77) Factorization in Sublinear TimeDominik Kempa, Tomasz Kociumaka. 2045-2055 [doi]
• 2+o(1) TimeAaron Bernstein, Joakim Blikstad, Thatchaphol Saranurak, Ta-Wei Tu. 2056-2077 [doi]
• Near-Optimal (1+ε)-Approximate Fully-Dynamic All-Pairs Shortest Paths in Planar GraphsArnold Filtser, Gramoz Goranci, Neel Patel, Maximilian Probst Gutenberg. 2078-2098 [doi]
• Universal Optimality of Dijkstra Via Beyond-Worst-Case HeapsBernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek. 2099-2130 [doi]
• Verifying Groups in Linear TimeShai Evra, Shay Gadot, Ohad Klein, Ilan Komargodski. 2131-2147 [doi]
• Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MISMohsen Ghaffari 0001, Christoph Grunau. 2148-2179 [doi]
• Power Series Composition in Near-Linear TimeYasunori Kinoshita, Baitian Li. 2180-2185 [doi]
• Faster (Δ+1)-Edge Coloring: Breaking the m√n Time BarrierSayan Bhattacharya, Din Carmon, Martín Costa, Shay Solomon, Tianyi Zhang. 2186-2201 [doi]
• An Improved Pseudopolynomial Time Algorithm for Subset SumLin Chen, Jiayi Lian, Yuchen Mao 0001, Guochuan Zhang. 2202-2216 [doi]
• Naively Sorting Evolving Data is Optimal and RobustGeorge Giakkoupis, Marcos Kiwi, Dimitrios Los. 2217-2242 [doi]
• Tight Bounds for Sorting Under Partial InformationIvor van der Hoog, Daniel Rutschmann. 2243-2252 [doi]
• Nearly Optimal List LabelingMichael A. Bender, Alex Conway 0001, Martín Farach-Colton, Hanna Komlós, Michal Koucký 0001, William Kuszmaul, Michael E. Saks. 2253-2274 [doi]
• Stochastic Online Correlated SelectionZiyun Chen, Zhiyi Huang 0002, Enze Sun. 2275-2294 [doi]
• Directed Isoperimetry and Monotonicity Testing: A Dynamical ApproachRenato Ferreira Pinto Jr.. 2295-2305 [doi]
• Efficient and Near-Optimal Noise Generation for Streaming Differential PrivacyKrishnamurthy Dj Dvijotham, H. Brendan McMahan, Krishna Pillutla, Thomas Steinke 0001, Abhradeep Thakurta. 2306-2317 [doi]
• A Strong Separation for Adversarially Robust ℓ0 Estimation for Linear SketchesElena Gribelyuk, Honghao Lin, David P. Woodruff, Huacheng Yu, Samson Zhou. 2318-2343 [doi]
• The ESPRIT Algorithm Under High Noise: Optimal Error Scaling and Noisy Super-ResolutionZhiyan Ding, Ethan N. Epperly, Lin Lin, Ruizhe Zhang 0016. 2344-2366 [doi]
• Constant-Depth Arithmetic Circuits for Linear Algebra ProblemsRobert Andrews 0003, Avi Wigderson. 2367-2386 [doi]
• Gradient Descent for Unbounded Convex Functions on Hadamard Manifolds and its Applications to Scaling ProblemsHiroshi Hirai, Keiya Sakabe. 2387-2402 [doi]
• On the Complexity of Avoiding Heavy ElementsZhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam. 2403-2412 [doi]
• Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility ProblemsMoïse Blanchard. 2413-2435 [doi]