Table of Contents

• Almost-Everywhere Circuit Lower Bounds from Non-Trivial DerandomizationLijie Chen, Xin Lyu 0002, R. Ryan Williams. 1-12 [doi]
• On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended AbstractLijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev. 13-23 [doi]
• Lifting with Simple Gadgets and Applications to Circuit and Proof ComplexitySusanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Marc Vinyals. 24-30 [doi]
• Tree-depth and the Formula Complexity of Subgraph IsomorphismDeepanshu Kush, Benjamin Rossman. 31-42 [doi]
• KRW Composition Theorems via LiftingSusanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere. 43-49 [doi]
• Characterizing Average-Case Complexity of PH by Worst-Case Meta-ComplexityShuichi Hirahara. 50-60 [doi]
• Near-linear Size Hypergraph Cut SparsifiersYu Chen, Sanjeev Khanna, Ansh Nagda. 61-72 [doi]
• Towards Better Approximation of Graph Crossing NumberJulia Chuzhoy, Sepideh Mahabadi, Zihan Tan. 73-84 [doi]
• Deterministic Min-cut in Poly-logarithmic Max-flowsJason Li, Debmalya Panigrahi. 85-92 [doi]
• Circulation Control for Faster Minimum Cost Flow in Unit-Capacity GraphsKyriakos Axiotis, Aleksander Madry, Adrian Vladu. 93-104 [doi]
• Cut-Equivalent Trees are Optimal for Min-Cut QueriesAmir Abboud, Robert Krauthgamer, Ohad Trabelsi. 105-118 [doi]
• Unit Capacity Maxflow in Almost $O(m^{4/3})$ TimeTarun Kathuria, Yang P. Liu, Aaron Sidford. 119-130 [doi]
• Low-Degree Hardness of Random Optimization ProblemsDavid Gamarnik, Aukosh Jagannath, Alexander S. Wein. 131-140 [doi]
• List Decodable Mean Estimation in Nearly Linear TimeYeshwanth Cherapanamjeri, Sidhanth Mohanty, Morris Yau. 141-148 [doi]
• Outlier-Robust Clustering of Gaussians and Other Non-Spherical MixturesAinesh Bakshi, Ilias Diakonikolas, Samuel B. Hopkins, Daniel Kane, Sushrut Karmalkar, Pravesh K. Kothari. 149-159 [doi]
• Collaborative Top Distribution Identifications with Limited Interaction (Extended Abstract)Nikolai Karpov, Qin Zhang 0001, Yuan Zhou 0007. 160-171 [doi]
• Kernel Density Estimation through Density Constrained Near Neighbor SearchMoses Charikar, Michael Kapralov, Navid Nouri, Paris Siminelakis. 172-183 [doi]
• Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable ModelsIlias Diakonikolas, Daniel M. Kane. 184-195 [doi]
• QMA-hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-KnowledgeAnne Broadbent, Alex B. Grilo. 196-205 [doi]
• Tight Limits on Nonlocality from Nontrivial Communication Complexity; a.k.a. Reliable Computation with Asymmetric Gate NoiseNoah Shutty, Mary Wootters, Patrick Hayden. 206-217 [doi]
• Decodable quantum LDPC codes beyond the square root distance barrier using high dimensional expandersShai Evra, Tali Kaufman, Gilles Zémor. 218-227 [doi]
• Towards Optimal Separations between Quantum and Randomized Query ComplexitiesAvishay Tal. 228-239 [doi]
• A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions: Extended AbstractShalev Ben-David, Eric Blais. 240-246 [doi]
• Towards a Proof of the Fourier-Entropy Conjecture?Esty Kelman, Guy Kindler, Noam Lifshitz, Dor Minzer, Muli Safra. 247-258 [doi]
• Mechanisms for a No-Regret Agent: Beyond the Common PriorModibo K. Camara, Jason D. Hartline, Aleck C. Johnsen. 259-270 [doi]
• Smoothed Complexity of 2-player Nash EquilibriaShant Boodaghians, Joshua Brakensiek, Samuel B. Hopkins, Aviad Rubinstein. 271-282 [doi]
• Coordinate Methods for Matrix GamesYair Carmon, Yujia Jin, Aaron Sidford, Kevin Tian. 283-293 [doi]
• Benchmark Design and Prior-independent OptimizationJason D. Hartline, Aleck C. Johnsen, Yingkai Li. 294-305 [doi]
• An O(log log m) Prophet Inequality for Subadditive Combinatorial AuctionsPaul Dütting, Thomas Kesselheim, Brendan Lucier. 306-317 [doi]
• The Coin Problem with Applications to Data StreamsMark Braverman, Sumegha Garg, David P. Woodruff. 318-329 [doi]
• Optimal Streaming Approximations for all Boolean Max-2CSPs and Max-ksatChi-Ning Chou, Alexander Golovnev, Santhoshini Velusamy. 330-341 [doi]
• Near-Quadratic Lower Bounds for Two-Pass Graph Streaming AlgorithmsSepehr Assadi, Ran Raz. 342-353 [doi]
• Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other ProblemsSepehr Assadi, Gillat Kol, Raghuvansh R. Saxena, Huacheng Yu. 354-364 [doi]
• Distributed Lower Bounds for Ruling SetsAlkida Balliu, Sebastian Brandt 0002, Dennis Olivetti. 365-376 [doi]
• Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed DerandomizationYi-Jun Chang, Thatchaphol Saranurak. 377-388 [doi]
• An Equivalence Between Private Classification and Online PredictionMark Bun, Roi Livni, Shay Moran. 389-402 [doi]
• A New Minimax Theorem for Randomized Algorithms (Extended Abstract)Shalev Ben-David, Eric Blais. 403-411 [doi]
• Edge-Weighted Online Bipartite MatchingMatthew Fahrbach, Zhiyi Huang 0002, Runzhou Tao, Morteza Zadimoghaddam. 412-423 [doi]
• Constant Depth Formula and Partial Function Versions of MCSP are HardRahul Ilango. 424-433 [doi]
• Unique Decoding of Explicit $\varepsilon$-balanced Codes Near the Gilbert-Varshamov BoundFernando Granha Jeronimo, Dylan Quintana, Shashank Srivastava, Madhur Tulsiani. 434-445 [doi]
• Deterministic and Efficient Interactive Coding from Hard-to-Decode Tree CodesZvika Brakerski, Yael Tauman Kalai, Raghuvansh R. Saxena. 446-457 [doi]
• LDPC Codes Achieve List Decoding CapacityJonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters. 458-469 [doi]
• Binary Interactive Error Resilience Beyond ${{}^{1}}\!/\!_{8}$ (or why $({{}^{1}}\!/\!_{2})^{3} > {{}^{1}}\!/\!_{8})$Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena. 470-481 [doi]
• Coded trace reconstruction in a constant number of tracesJoshua Brakensiek, Ray Li, Bruce Spang. 482-493 [doi]
• Network Coding Gaps for Completion Times of Multiple UnicastsBernhard Haeupler, David Wajc, Goran Zuzic. 494-505 [doi]
• Robust and Sample Optimal Algorithms for PSD Low Rank ApproximationAinesh Bakshi, Nadiia Chepurko, David P. Woodruff. 506-516 [doi]
• Near Optimal Linear Algebra in the Online and Sliding Window ModelsVladimir Braverman, Petros Drineas, Cameron Musco, Christopher Musco, Jalaj Upadhyay, David P. Woodruff, Samson Zhou. 517-528 [doi]
• Pseudospectral Shattering, the Sign Function, and Diagonalization in Nearly Matrix Multiplication TimeJess Banks, Jorge Garza-Vargas, Archit Kulkarni, Nikhil Srivastava. 529-540 [doi]
• Algorithms and Hardness for Linear Algebra on Geometric GraphsJosh Alman, Timothy Chu, Aaron Schild, Zhao Song 0002. 541-552 [doi]
• Sparse PCA: Algorithms, Adversarial Perturbations and CertificatesTommaso d'Orsi, Pravesh K. Kothari, Gleb Novikov, David Steurer. 553-564 [doi]
• Maximizing Determinants under Matroid ConstraintsVivek Madan, Aleksandar Nikolov, Mohit Singh, Uthaipon Tantipongpipat. 565-576 [doi]
• Adjacency Labelling for Planar Graphs (and Beyond)Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin. 577-588 [doi]
• On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free GraphsVincent Cohen-Addad, Arnold Filtser, Philip N. Klein, Hung Le. 589-600 [doi]
• Twin-width I: tractable FO model checkingÉdouard Bonnet, Eun Jung Kim 0002, Stéphan Thomassé, Rémi Watrigant. 601-612 [doi]
• Independent Set on $\mathrm{P}_{k}$-Free Graphs in Quasi-Polynomial TimePeter Gartland, Daniel Lokshtanov. 613-624 [doi]
• Isomorphism Testing for Graphs Excluding Small MinorsMartin Grohe, Daniel Wiebking, Daniel Neuen. 625-636 [doi]
• Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian SolvingSimon Apers, Ronald de Wolf. 637-648 [doi]
• Symmetries, Graph Properties, and Quantum SpeedupsShalev Ben-David, Andrew M. Childs, András Gilyén, William Kretschmer, Supartha Podder, Daochen Wang. 649-660 [doi]
• Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphsLaura Mancinska, David E. Roberson. 661-672 [doi]
• Tight Quantum Time-Space Tradeoffs for Function InversionKai-Min Chung, Siyao Guo, Qipeng Liu, Luowen Qian. 673-684 [doi]
• Sample-efficient learning of quantum many-body systemsAnurag Anshu, Srinivasan Arunachalam, Tomotaka Kuwahara, Mehdi Soleimanifar. 685-691 [doi]
• Entanglement is Necessary for Optimal Quantum Property TestingSébastien Bubeck, Sitan Chen, Jerry Li 0001. 692-703 [doi]
• Lazy Search TreesBryce Sandlund, Sebastian Wild. 704-715 [doi]
• 2D Generalization of Fractional Cascading on Axis-aligned Planar SubdivisionsPeyman Afshani, Pingan Cheng. 716-727 [doi]
• Subsets and Supermajorities: Optimal Hashing-based Set Similarity SearchThomas D. Ahle, Jakob Bæk Tejs Knudsen. 728-739 [doi]
• Polynomial Data Structure Lower Bounds in the Group ModelAlexander Golovnev, Gleb Posobin, Oded Regev 0001, Omri Weinstein. 740-751 [doi]
• An Adaptive Step Toward the Multiphase ConjectureYoung Kun-Ko, Omri Weinstein. 752-761 [doi]
• Analysis of Two-variable Recurrence Relations with Application to Parameterized ApproximationsAriel Kulik, Hadas Shachnai. 762-773 [doi]
• New Techniques for Proving Fine-Grained Average-Case HardnessMina Dalirrooyfard, Andrea Lincoln, Virginia Vassilevska Williams. 774-785 [doi]
• Monochromatic Triangles, Triangle Listing and APSPVirginia Vassilevska Williams, Yinzhan Xu. 786-797 [doi]
• A Parameterized Approximation Scheme for Min $k$-CutDaniel Lokshtanov, Saket Saurabh 0001, Vaishali Surianarayanan. 798-809 [doi]
• Hypergraph $k$-cut for fixed $k$ in deterministic polynomial timeKarthekeyan Chandrasekaran, Chandra Chekuri. 810-821 [doi]
• Scheduling with Communication Delays via LP Hierarchies and ClusteringSami Davies, Janardhan Kulkarni, Thomas Rothvoss, Jakub Tarnawski, Yihao Zhang. 822-833 [doi]
• Scheduling Precedence-Constrained Jobs on Related Machines with Communication DelayBiswaroop Maiti, Rajmohan Rajaraman, David Stalfa, Zoya Svitkina, Aravindan Vijayaraghavan. 834-845 [doi]
• Local Proofs Approaching the Witness Length [Extended Abstract]Noga Ron-Zewi, Ron D. Rothblum. 846-857 [doi]
• Rigid Matrices From Rectangular PCPs or: Hard Claims Have Complex ProofsAmey Bhangale, Prahladh Harsha, Orr Paradise, Avishay Tal. 858-869 [doi]
• On the Existence of Algebraically Natural ProofsPrerona Chatterjee, Mrinal Kumar 0001, C. Ramya, Ramprasad Saptharishi, Anamay Tengse. 870-880 [doi]
• Symbolic determinant identity testing (SDIT) is not a null cone problem; and the symmetries of algebraic varietiesVisu Makam, Avi Wigderson. 881-888 [doi]
• Learning sums of powers of low-degree polynomials in the non-degenerate caseAnkit Garg, Neeraj Kayal, Chandan Saha 0001. 889-899 [doi]
• Proximity Gaps for Reed-Solomon CodesEli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf. 900-909 [doi]
• A Faster Interior Point Method for Semidefinite ProgrammingHaotian Jiang, Tarun Kathuria, Yin Tat Lee, Swati Padmanabhan, Zhao Song 0002. 910-918 [doi]
• Bipartite Matching in Nearly-linear Time on Moderately Dense GraphsJan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song 0002, Di Wang. 919-930 [doi]
• Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate SolversDaniel Dadush, Bento Natura, László A. Végh. 931-942 [doi]
• Subexponential LPs Approximate Max-CutSamuel B. Hopkins, Tselil Schramm, Luca Trevisan. 943-953 [doi]
• Sum-of-Squares Lower Bounds for Sherrington-Kirkpatrick via Planted Affine PlanesMrinalkanti Ghosh, Fernando Granha Jeronimo, Chris Jones, Aaron Potechin, Goutham Rajendran. 954-965 [doi]
• Approximation Algorithms for Stochastic Minimum-Norm Combinatorial OptimizationSharat Ibrahimpur, Chaitanya Swamy. 966-977 [doi]
• Faster Approximate Pattern Matching: A Unified ApproachPanagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz. 978-989 [doi]
• Edit Distance in Near-Linear Time: it's a Constant FactorAlexandr Andoni, Negev Shekel Nosatzki. 990-1001 [doi]
• Resolution of the Burrows-Wheeler Transform ConjectureDominik Kempa, Tomasz Kociumaka. 1002-1013 [doi]
• Framework for ER-Completeness of Two-Dimensional Packing ProblemsMikkel Abrahamsen, Tillmann Miltzow, Nadja Seiferth. 1014-1021 [doi]
• Smoothing the gap between NP and ERJeff Erickson 0001, Ivor van der Hoog, Tillmann Miltzow. 1022-1033 [doi]
• Point Location and Active Learning: Learning Halfspaces Almost OptimallyMax Hopkins, Daniel Kane, Shachar Lovett, Gaurav Mahajan. 1034-1044 [doi]
• Explicit near-fully X-Ramanujan graphsRyan O'Donnell, Xinyu Wu. 1045-1056 [doi]
• Nearly Optimal Pseudorandomness From HardnessDean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman. 1057-1068 [doi]
• Correlated Pseudorandom Functions from Variable-Density LPNElette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl. 1069-1080 [doi]
• An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against NatureAndrew Drucker. 1081-1090 [doi]
• A Dichotomy for Real Boolean Holant ProblemsShuai Shao 0001, Jin-yi Cai. 1091-1102 [doi]
• Dichotomy for Graph Homomorphisms with Complex Values on Bounded Degree GraphsJin-yi Cai, Artem Govorov. 1103-1111 [doi]
• Near-Optimal Decremental SSSP in Dense Weighted DigraphsAaron Bernstein, Maximilian Probst Gutenberg, Christian Wulff-Nilsen. 1112-1122 [doi]
• Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion BalancingAaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak. 1123-1134 [doi]
• Fast Dynamic Cuts, Distances and Effective Resistances via Vertex SparsifiersLi Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak. 1135-1146 [doi]
• Fully-Dynamic Submodular Cover with Bounded RecourseAnupam Gupta, Roie Levin. 1147-1157 [doi]
• A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and BeyondJulia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak. 1158-1167 [doi]
• Sublinear-Time Algorithms for Computing & Embedding Gap Edit DistanceTomasz Kociumaka, Barna Saha. 1168-1179 [doi]
• Testing linear-invariant propertiesJonathan Tidor, Yufei Zhao. 1180-1190 [doi]
• Testing Positive Semi-Definiteness via Random SubmatricesAinesh Bakshi, Nadiia Chepurko, Rajesh Jayaram. 1191-1202 [doi]
• Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding TimeMahdi Cheraghchi, Vasileios Nakos. 1203-1213 [doi]
• Pandora's Box with Correlations: Learning and ApproximationShuchi Chawla 0001, Evangelia Gergatsouli, Yifeng Teng, Christos Tzamos, Ruimin Zhang. 1214-1225 [doi]
• Extractors and Secret Sharing Against Bounded Collusion ProtocolsEshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Ashutosh Kumar 0002, Xin Li 0006, Raghu Meka, David Zuckerman. 1226-1242 [doi]
• On One-way Functions and Kolmogorov ComplexityYanyi Liu, Rafael Pass. 1243-1254 [doi]
• Is it Easier to Prove Theorems that are Guaranteed to be True?Rafael Pass, Muthuramakrishnan Venkitasubramaniam. 1255-1267 [doi]
• A Tight Lower Bound on Adaptively Secure Full-Information Coin FlipIftach Haitner, Yonatan Karidi-Heller. 1268-1276 [doi]
• The Round Complexity of Perfect MPC with Active Security and Optimal ResiliencyBenny Applebaum, Eliran Kachlon, Arpita Patra. 1277-1284 [doi]
• A constant rate non-malleable code in the split-state modelDivesh Aggarwal, Maciej Obremski. 1285-1294 [doi]
• High-precision Estimation of Random Walks in Small SpaceAmirMahdi Ahmadinejad, Jonathan A. Kelner, Jack Murtagh, John Peebles, Aaron Sidford, Salil P. Vadhan. 1295-1306 [doi]
• Rapid Mixing of Glauber Dynamics up to Uniqueness via ContractionZongchen Chen, Kuikui Liu, Eric Vigoda. 1307-1318 [doi]
• Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore ModelNima Anari, Kuikui Liu, Shayan Oveis Gharan. 1319-1330 [doi]
• Isotropy and Log-Concave Polynomials: Accelerated Sampling and High-Precision Counting of Matroid BasesNima Anari, Michal Derezinski. 1331-1344 [doi]
• The complexity of approximating averages on bounded-degree graphsAndreas Galanis, Daniel Stefankovic, Eric Vigoda. 1345-1355 [doi]
• Counting Small Induced Subgraphs Satisfying Monotone PropertiesMarc Roth, Johannes Schmitt 0002, Philip Wellnitz. 1356-1367 [doi]
• Beyond Tree Embeddings - a Deterministic Framework for Network Design with Deadlines or DelayYossi Azar, Noam Touitou. 1368-1379 [doi]
• Fully Online Matching II: Beating Ranking and Water-fillingZhiyi Huang 0002, Zhihao Gavin Tang, Xiaowei Wu 0001, Yuhao Zhang 0001. 1380-1391 [doi]
• Stochastic Weighted Matching: (Stochastic Weighted Matching: (1-ε) Approximation -\varepsilon$) ApproximationSoheil Behnezhad, Mahsa Derakhshan. 1392-1403 [doi]
• Optimal anytime regret for two expertsNicholas J. A. Harvey, Christopher Liaw, Edwin A. Perkins, Sikander Randhawa. 1404-1415 [doi]
• AdWords in a PanoramaZhiyi Huang 0002, Qiankun Zhang, Yuhao Zhang 0001. 1416-1426 [doi]
• Resolving the Optimal Metric Distortion ConjectureVasilis Gkatzelis, Daniel Halpern 0002, Nisarg Shah 0001. 1427-1438 [doi]
• Communication complexity of Nash equilibrium in potential games (extended abstract)Yakov Babichenko, Aviad Rubinstein. 1439-1445 [doi]