Table of Contents

• Nonlocal games, compression theorems, and the arithmetical hierarchyHamoon Mousavi, Seyed Sajjad Nezhadi, Henry Yuen. 1-11 [doi]
• An area law for 2d frustration-free spin systemsAnurag Anshu, Itai Arad, David Gosset. 12-18 [doi]
• Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjectureSevag Gharibian, François Le Gall. 19-32 [doi]
• Near-optimal Quantum algorithms for multivariate mean estimationArjan Cornelissen, Yassine Hamoudi, Sofiène Jerbi. 33-43 [doi]
• Distributed Quantum inner product estimationAnurag Anshu, Zeph Landau, Yunchao Liu. 44-51 [doi]
• The power of two choices in graphical allocationNikhil Bansal 0001, Ohad N. Feldheim. 52-63 [doi]
• Expanders via local edge flips in quasilinear timeGeorge Giakkoupis. 64-76 [doi]
• (Fractional) online stochastic matching via fine-grained offline statisticsZhihao Gavin Tang, Jinzhao Wu, Hongxun Wu. 77-90 [doi]
• The power of multiple choices in online stochastic matchingZhiyi Huang 0002, Xinkai Shu, Shuyi Yan. 91-103 [doi]
• Online edge coloring via tree recurrences and correlation decayJanardhan Kulkarni, Yang P. Liu, Ashwin Sah, Mehtaab Sawhney, Jakub Tarnawski. 104-116 [doi]
• The shortest even cycle problem is tractableAndreas Björklund, Thore Husfeldt, Petteri Kaski. 117-130 [doi]
• k-cut on simple graphsZhiyang He, Jason Li 0006. 131-136 [doi]
• Edge connectivity augmentation in near-linear timeRuoxu Cen, Jason Li, Debmalya Panigrahi. 137-150 [doi]
• Optimal vertex connectivity oraclesSeth Pettie, Thatchaphol Saranurak, Longhui Yin. 151-161 [doi]
• Deterministic massively parallel connectivitySam Coy, Artur Czumaj. 162-175 [doi]
• Hypercontractivity on high dimensional expandersTom Gur, Noam Lifshitz, Siqi Liu. 176-184 [doi]
• Hypercontractivity on high dimensional expandersMitali Bafna, Max Hopkins, Tali Kaufman, Shachar Lovett. 185-194 [doi]
• Approximate polymorphismsGilad Chase, Yuval Filmus, Dor Minzer, Elchanan Mossel, Nitin Saurabh. 195-202 [doi]
• Learning low-degree functions from a logarithmic number of random queriesAlexandros Eskenazis, Paata Ivanisvili. 203-207 [doi]
• Positive spectrahedra: invariance principles and pseudorandom generatorsSrinivasan Arunachalam, Penghui Yao. 208-221 [doi]
• New streaming algorithms for high dimensional EMD and MSTXi Chen, Rajesh Jayaram, Amit Levi, Erik Waingarten. 222-233 [doi]
• Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for ∆-coloringSepehr Assadi, Pankaj Kumar, Parth Mittal. 234-247 [doi]
• ε) passes in the semi-streaming model and beyondManuela Fischer, Slobodan Mitrovic, Jara Uitto. 248-260 [doi]
• Deterministic graph coloring in the streaming modelSepehr Assadi, Andrew Chen, Glenn Sun. 261-274 [doi]
• Linear space streaming lower bounds for approximating CSPsChi-Ning Chou, Alexander Golovnev, Madhu Sudan 0001, Ameya Velingker, Santhoshini Velusamy. 275-288 [doi]
• A PTAS for unsplittable flow on a pathFabrizio Grandoni 0001, Tobias Mömke, Andreas Wiese. 289-302 [doi]
• A subpolynomial approximation algorithm for graph crossing number in low-degree graphsJulia Chuzhoy, Zihan Tan. 303-316 [doi]
• Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratiosMatthias Englert, Nicolaos Matsakis, Pavel Veselý. 317-330 [doi]
• Flow time scheduling and prefix Beck-FialaNikhil Bansal 0001, Lars Rohwedder, Ola Svensson. 331-342 [doi]
• Bypassing the surface embedding: approximation schemes for network design in minor-free graphsVincent Cohen-Addad. 343-356 [doi]
• Locally testable codes with constant rate, distance, and localityIrit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, Shahar Mozes. 357-374 [doi]
• Asymptotically good Quantum and locally testable classical LDPC codesPavel Panteleev, Gleb Kalachev. 375-388 [doi]
• Ideals, determinants, and straightening: proving and using lower bounds for polynomial idealsRobert Andrews 0003, Michael A. Forbes. 389-402 [doi]
• Fast, algebraic multivariate multipoint evaluation in small characteristic and applicationsVishwas Bhargava, Sumanta Ghosh, Mrinal Kumar 0001, Chandra Kanta Mohapatra. 403-415 [doi]
• Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplicationSébastien Tavenas, Nutan Limaye, Srikanth Srinivasan 0001. 416-425 [doi]
• Combinatorics via closed orbits: number theoretic Ramanujan graphs are not unique neighbor expandersAmitay Kamber, Tali Kaufman. 426-435 [doi]
• On the complexity of CSP-based ideal membership problemsAndrei A. Bulatov, Akbar Rafiey. 436-449 [doi]
• Near-optimal distributed degree+1 coloringMagnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin, Tigran Tonoyan. 450-463 [doi]
• Distributed ∆-coloring plays hide-and-seekAlkida Balliu, Sebastian Brandt 0002, Fabian Kuhn, Dennis Olivetti. 464-477 [doi]
• ε)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithmsVáclav Rozhon, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, Jason Li. 478-487 [doi]
• Improved communication complexity of fault-tolerant consensusMohammad Taghi Hajiaghayi, Dariusz R. Kowalski, Jan Olkowski. 488-501 [doi]
• Byzantine agreement in polynomial time with near-optimal resilienceShang-En Huang, Seth Pettie, Leqi Zhu. 502-514 [doi]
• No self-concordant barrier interior point method is strongly polynomialXavier Allamigeon, Stéphane Gaubert, Nicolas Vandame. 515-528 [doi]
• p-norm regressionArun Jambulapati, Yang P. Liu, Aaron Sidford. 529-542 [doi]
• Faster maxflow via improved dynamic spectral vertex sparsifiersJan van den Brand, Yu Gao, Arun Jambulapati, Yin Tat Lee, Yang P. Liu, Richard Peng, Aaron Sidford. 543-556 [doi]
• Sparsified block elimination for directed laplaciansRichard Peng, Zhuoqing Song. 557-567 [doi]
• Matrix anti-concentration inequalities with applicationsZipei Nie. 568-581 [doi]
• Circuits resilient to short-circuit errorsKlim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena. 582-594 [doi]
• Explicit binary tree codes with sub-logarithmic size alphabetInbar Ben Yaacov, Gil Cohen, Tal Yankovitz. 595-608 [doi]
• Interactive error correcting codes over binary erasure channels resilient to > ½ adversarial corruptionMeghal Gupta, Yael Tauman Kalai, Rachel Yun Zhang. 609-622 [doi]
• The query complexity of certificationGuy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan. 623-636 [doi]
• Matrix discrepancy from Quantum communicationSamuel B. Hopkins, Prasad Raghavendra, Abhishek Shetty. 637-648 [doi]
• A new framework for matrix discrepancy: partial coloring bounds via mirror descentDaniel Dadush, Haotian Jiang, Victor Reis. 649-658 [doi]
• Uniform approximations for Randomized Hadamard Transforms with applicationsYeshwanth Cherapanamjeri, Jelani Nelson. 659-671 [doi]
• Testing thresholds for high-dimensional sparse random geometric graphsSiqi Liu, Sidhanth Mohanty, Tselil Schramm, Elizabeth Yang. 672-677 [doi]
• Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than randomVenkatesan Guruswami, Pravesh K. Kothari, Peter Manohar. 678-689 [doi]
• On the hardness of dominant strategy mechanism designShahar Dobzinski, Shiri Ron, Jan Vondrák. 690-703 [doi]
• Computing simple mechanisms: Lift-and-round over marginal reduced formsYang Cai 0001, Argyris Oikonomou, Mingfei Zhao. 704-717 [doi]
• Approximately efficient bilateral tradeYuan Deng, Jieming Mao, Balasubramanian Sivan, Kangning Wang. 718-721 [doi]
• Pricing ordered itemsShuchi Chawla 0001, Rojin Rezvan, Yifeng Teng, Christos Tzamos. 722-735 [doi]
• Near-optimal no-regret learning for correlated equilibria in multi-player general-sum gamesIoannis Anagnostides, Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson, Noah Golowich, Tuomas Sandholm. 736-749 [doi]
• Hamiltonian complexity in the thermodynamic limitDorit Aharonov, Sandy Irani. 750-763 [doi]
• Computational complexity of the ground state energy density problemJames D. Watson, Toby S. Cubitt. 764-775 [doi]
• Optimizing strongly interacting fermionic HamiltoniansMatthew B. Hastings, Ryan O'Donnell. 776-789 [doi]
• Public-key Quantum money with a classical bankOmri Shmueli. 790-803 [doi]
• Quantum garbled circuitsZvika Brakerski, Henry Yuen. 804-817 [doi]
• Reproducibility in learningRussell Impagliazzo, Rex Lei, Toniann Pitassi, Jessica Sorrell. 818-831 [doi]
• Kalman filtering with adversarial corruptionsSitan Chen, Frederic Koehler, Ankur Moitra, Morris Yau. 832-845 [doi]
• Fast rates for nonparametric online learning: from realizability to learning in gamesConstantinos Daskalakis, Noah Golowich. 846-859 [doi]
• Binary perceptron: efficient algorithms can find solutions in a rare well-connected clusterEmmanuel Abbe, Shuangping Li, Allan Sly. 860-873 [doi]
• Learning general halfspaces with general Massart noise under the Gaussian distributionIlias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis. 874-885 [doi]
• Fast FPT-approximation of branchwidthFedor V. Fomin, Tuukka Korhonen. 886-899 [doi]
• Lossy planarization: a constant-factor approximate kernelization for planar vertex deletionBart M. P. Jansen, Michal Wlodarczyk 0001. 900-913 [doi]
• Fixed-parameter tractability of graph isomorphism in graphs with an excluded minorDaniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001. 914-923 [doi]
• Twin-width IV: ordered graphs and matricesÉdouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Torunczyk. 924-937 [doi]
• Directed flow-augmentationEun Jung Kim 0002, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström. 938-947 [doi]
• The optimal error resilience of interactive communication over binary channelsMeghal Gupta, Rachel Yun Zhang. 948-961 [doi]
• The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexityZhiyuan Fan, Jiatu Li, Tianqi Yang 0001. 962-975 [doi]
• k-CSPs: IAmey Bhangale, Subhash Khot, Dor Minzer. 976-988 [doi]
• A characterization of approximability for biased CSPsEuiwoong Lee, Suprovat Ghoshal. 989-997 [doi]
• Parallel repetition for all 3-player games over binary alphabetUma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan. 998-1009 [doi]
• Constant inapproximability for PPAArgyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos. 1010-1023 [doi]
• Complexity classification of counting graph homomorphisms modulo a prime numberAndrei A. Bulatov, Amirhossein Kazeminia. 1024-1037 [doi]
• Towards optimal lower bounds for k-median and k-means coresetsVincent Cohen-Addad, Kasper Green Larsen, David Saulpic, Chris Schwiegelshohn. 1038-1051 [doi]
• ε-approximation algorithm for geometric bipartite matchingPankaj K. Agarwal, Hsien-Chih Chang, Sharath Raghvendra, Allen Xiao. 1052-1065 [doi]
• Locality-sensitive orderings and applications to reliable spannersArnold Filtser, Hung Le. 1066-1079 [doi]
• Nearly optimal vertex fault-tolerant spanners in optimal time: sequential, distributed, and parallelMerav Parter. 1080-1092 [doi]
• Maintaining exact distances under multiple edge failuresRan Duan, Hanlin Ren. 1093-1101 [doi]
• Almost-optimal sublinear-time edit distance in the low distance regimeKarl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos. 1102-1115 [doi]
• Edge sampling and graph parameter estimation via vertex neighborhood accessesJakub Tetek, Mikkel Thorup. 1116-1129 [doi]
• 1/3 matrix-vector productsAinesh Bakshi, Kenneth L. Clarkson, David P. Woodruff. 1130-1143 [doi]
• Sublinear time spectral density estimationVladimir Braverman, Aditya Krishnan 0001, Christopher Musco. 1144-1157 [doi]
• Memory bounds for the experts problemVaidehi Srinivas, David P. Woodruff, Ziyu Xu, Samson Zhou. 1158-1171 [doi]
• A strong version of Cobham's theoremPhilipp Hieronymi, Christian Schulz 0013. 1172-1179 [doi]
• n) circuit lower bounds for explicit functionsJiatu Li, Tianqi Yang 0001. 1180-1193 [doi]
• The approximate degree of DNF and CNF formulasAlexander A. Sherstov. 1194-1207 [doi]
• Verifying the unseen: interactive proofs for label-invariant distribution propertiesTal Herman, Guy N. Rothblum. 1208-1219 [doi]
• Randomized communication and implicit graph representationsNathaniel Harms, Sebastian Wild, Viktor Zamaraev. 1220-1233 [doi]
• k arbitrary GaussiansAinesh Bakshi, Ilias Diakonikolas, He Jia, Daniel M. Kane, Pravesh K. Kothari, Santosh S. Vempala. 1234-1247 [doi]
• Clustering mixtures with almost optimal separation in polynomial timeAllen Liu, Jerry Li 0001. 1248-1261 [doi]
• Clustering mixture models in almost-linear time via list-decodable mean estimationIlias Diakonikolas, Daniel M. Kane, Daniel Kongsgaard, Jerry Li 0001, Kevin Tian. 1262-1275 [doi]
• List-decodable covariance estimationMisha Ivkov, Pravesh K. Kothari. 1276-1283 [doi]
• On the optimal time/space tradeoff for hash tablesMichael A. Bender, Martin Farach-Colton, John Kuszmaul, William Kuszmaul, Mingmou Liu. 1284-1297 [doi]
• An extendable data structure for incremental stable perfect hashingIoana Oriana Bercea, Guy Even. 1298-1310 [doi]
• ε-emulators for planar graphsHsien-Chih Chang, Robert Krauthgamer, Zihan Tan. 1311-1324 [doi]
• Hop-constrained expander decompositions, oblivious routing, and distributed universal optimalityBernhard Haeupler, Harald Räcke, Mohsen Ghaffari 0001. 1325-1338 [doi]
• Optimal oblivious reconfigurable networksDaniel Amir, Tegan Wilson, Vishal Shrivastav, Hakim Weatherspoon, Robert Kleinberg, Rachit Agarwal 0001. 1339-1352 [doi]
• Proving as fast as computing: succinct arguments with constant prover overheadNoga Ron-Zewi, Ron D. Rothblum. 1353-1363 [doi]
• Rate one-third non-malleable codesDivesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar. 1364-1377 [doi]
• Deniable encryption in a Quantum worldAndrea Coladangelo, Shafi Goldwasser, Umesh V. Vazirani. 1378-1391 [doi]
• On the complexity of two-party differential privacyIftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia. 1392-1405 [doi]
• Efficient mean estimation with pure differential privacy via a sum-of-squares exponential mechanismSamuel B. Hopkins, Gautam Kamath 0001, Mahbod Majid. 1406-1417 [doi]
• Entropic independence: optimal mixing of down-up random walksNima Anari, Vishesh Jain, Frederic Koehler, Huy Tuan Pham, Thuy Duong Vuong. 1418-1430 [doi]
• Simple parallel algorithms for single-site dynamicsHongyang Liu, Yitong Yin. 1431-1444 [doi]
• Low-temperature Ising dynamics with random initializationsReza Gheissari, Alistair Sinclair. 1445-1458 [doi]
• Computational thresholds for the fixed-magnetization Ising modelCharlie Carlson, Ewan Davies, Alexandra Kolla, Will Perkins. 1459-1472 [doi]
• Approximate counting and sampling via local central limit theoremsVishesh Jain, Will Perkins, Ashwin Sah, Mehtaab Sawhney. 1473-1486 [doi]
• Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyondAmir Abboud, Karl Bringmann, Seri Khoury, Or Zamir. 1487-1500 [doi]
• Hardness for triangle problems under even more believable hypotheses: reductions from real APSP, real 3SUM, and OVTimothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu. 1501-1514 [doi]
• Tight dynamic problem lower bounds from generalized BMM and OMvCe Jin, Yinzhan Xu. 1515-1528 [doi]
• Faster min-plus product for monotone instancesShucheng Chi, Ran Duan, Tianle Xie, Tianyi Zhang 0008. 1529-1542 [doi]
• Counting small induced subgraphs with hereditary propertiesJacob Focke, Marc Roth. 1543-1551 [doi]
• Pseudodeterminism: promises and lowerboundsPeter Dixon 0002, Aduri Pavan, Jason Vander Woude, N. V. Vinodchandran. 1552-1565 [doi]
• Worst-case to average-case reductions via additive combinatoricsVahid R. Asadi, Alexander Golovnev, Tom Gur, Igor Shinkar. 1566-1574 [doi]
• Robustness of average-case meta-complexity via pseudorandomnessRahul Ilango, Hanlin Ren, Rahul Santhanam. 1575-1583 [doi]
• Extractors for sum of two sourcesEshan Chattopadhyay, Jyun-Jie Liao. 1584-1597 [doi]
• Breaching the 2-approximation barrier for the forest augmentation problemFabrizio Grandoni 0001, Afrouz Jabal Ameli, Vera Traub. 1598-1611 [doi]
• k-edge connected multi-subgraph problemAnna R. Karlin, Nathan Klein, Shayan Oveis Gharan, Xinzhi Zhang 0002. 1612-1620 [doi]
• k-median, via nested quasi-independent setsVincent Cohen-Addad, Hossein Esfandiari, Vahab S. Mirrokni, Shyam Narayanan. 1621-1628 [doi]
• k-means: don't be greedy, plant bigger trees!Konstantin Makarychev, Liren Shan. 1629-1642 [doi]
• Subquadratic dynamic path reporting in directed graphs against an adaptive adversaryAdam Karczmarz, Anish Mukherjee 0001, Piotr Sankowski. 1643-1656 [doi]
• Dynamic suffix array with polylogarithmic queries and updatesDominik Kempa, Tomasz Kociumaka. 1657-1670 [doi]
• Dynamic algorithms against an adaptive adversary: generic constructions and lower boundsAmos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer. 1671-1684 [doi]
• On the complexity of dynamic submodular maximizationXi Chen, Binghui Peng. 1685-1698 [doi]