Table of Contents

• Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton BoundsYeyuan Chen, Zihan Zhang 0001. 1-12 [doi]
• Simulating Time with Square-Root SpaceR. Ryan Williams. 13-23 [doi]
• Vizing's Theorem in Near-Linear TimeSepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang 0008. 24-35 [doi]
• Breaking the Sorting Barrier for Directed Single-Source Shortest PathsRan Duan, Jiayi Mao, Xiao Mao, Xinkai Shu, Longhui Yin. 36-44 [doi]
• Quasi-Linear Size PCPs with Small Soundness from HDXMitali Bafna, Dor Minzer, Nikhil Vyas 0001, Zhiwei Yun. 45-53 [doi]
• Asymptotically Optimal Hardness for k-Set Packing and k-Matroid IntersectionEuiwoong Lee, Ola Svensson, Theophile Thiery. 54-61 [doi]
• On Approximability of Satisfiable k-CSPs: VAmey Bhangale, Subhash Khot, Dor Minzer. 62-71 [doi]
• Hardness of 4-Colouring k-Colourable GraphsSergey Avvakumov, Marek Filakovský, Jakub Oprsal, Gianluca Tasinato, Uli Wagner 0001. 72-83 [doi]
• Sum-of-Squares Lower Bounds for Coloring Random GraphsAaron Potechin, Jeff Xu. 84-95 [doi]
• Hypercontractivity on HDX II: Symmetrization and q-NormsMax Hopkins. 96-103 [doi]
• Parallel Repetition for 3-Player XOR GamesAmey Bhangale, Mark Braverman, Subhash Khot, Yang Liu, Dor Minzer. 104-110 [doi]
• Linear-Time Algorithms for k-Edge-Connected Components, k-Lean Tree Decompositions, and MoreTuukka Korhonen. 111-119 [doi]
• Network Unreliability in Almost-Linear TimeRuoxu Cen, Jason Li, Debmalya Panigrahi. 120-131 [doi]
• Deterministic Dynamic Maximal Matching in Sublinear Update TimeAaron Bernstein, Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak. 132-143 [doi]
• 2n)-Time Barrier for Vertex-Weighted Global Minimum CutJulia Chuzhoy, Ohad Trabelsi. 144-155 [doi]
• Fully Dynamic Biconnectivity in Õ(log² n) TimeJacob Holm, Wojciech Nadara, Eva Rotenberg, Marek Sokolowski 0001. 156-165 [doi]
• Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic DepthZhuan Khye Koh, Omri Weinstein, Sorrachai Yingchareonthawornchai. 166-177 [doi]
• Founding Quantum Cryptography on Quantum Advantage, or, Towards Cryptography from #P HardnessDakshita Khurana, Kabir Tomer. 178-188 [doi]
• Quantum-Computable One-Way Functions without One-Way FunctionsWilliam Kretschmer, Luowen Qian, Avishay Tal. 189-200 [doi]
• A General Quantum Duality for Representations of Groups with Applications to Quantum Money, Lightning, and FireJohn Bostanci, Barak Nehoran, Mark Zhandry. 201-212 [doi]
• Quantum One-Time Programs, RevisitedAparna Gupte, Jiahui Liu, Justin Raizes, Bhaskar Roberts, Vinod Vaikuntanathan. 213-221 [doi]
• A Bound on the Quantum Value of All Compiled Nonlocal GamesAlexander Kulpe, Giulio Malavolta, Connor Paddock, Simon Schmidt, Michael Walter. 222-233 [doi]
• Classical Commitments to Quantum StatesSam Gunn, Yael Tauman Kalai, Anand Natarajan 0001, Ági Villányi. 234-244 [doi]
• Linear Hashing Is OptimalMichael Jaber, Vinayak M. Kumar, David Zuckerman. 245-255 [doi]
• A Framework for Building Data Structures from Communication ProtocolsAlexandr Andoni, Shunhua Jiang, Omri Weinstein. 256-267 [doi]
• Optimal Non-oblivious Open AddressingMichael A. Bender, William Kuszmaul, Renfei Zhou. 268-277 [doi]
• Optimal Static Dictionary with Worst-Case Constant Query TimeYang Hu, Jingxun Liang, Huacheng Yu, Junkai Zhang, Renfei Zhou. 278-289 [doi]
• On the Hardness Hierarchy for the O(n√log n) Complexity in the Word RAMDominik Kempa, Tomasz Kociumaka. 290-300 [doi]
• The Hypergraph Removal ProcessFelix Joos, Marcus Kühn. 301-309 [doi]
• Sandwiching Random Geometric Graphs and Erdos-Renyi with Applications: Sharp Thresholds, Robust Testing, and EnumerationKiril Bangachev, Guy Bresler. 310-321 [doi]
• A Sharp Version of Talagrand's Selector Process Conjecture and an Application to Rounding Fractional CoversHuy Tuan Pham. 322-328 [doi]
• Disjoint Connected Dominating Sets in Pseudorandom GraphsNemanja Draganic, Michael Krivelevich. 329-335 [doi]
• Minimum Degree Edge-Disjoint Hamilton Cycles in Random Directed GraphsAsaf Ferber, Adva Mond. 336-347 [doi]
• Bypassing the Noisy Parity Barrier: Learning Higher-Order Markov Random Fields from DynamicsJason Gaitonde, Ankur Moitra, Elchanan Mossel. 348-359 [doi]
• Optimality of Frequency Moment EstimationMark Braverman, Or Zamir. 360-370 [doi]
• Simple and Optimal Algorithms for Heavy Hitters and Frequency Moments in Distributed ModelsZengfeng Huang, Zhongzheng Xiong, Xiaoyi Zhu, Zhewei Wei. 371-382 [doi]
• Harmonic Decomposition in Data SketchesDingyu Wang. 383-394 [doi]
• Lifting Linear Sketches: Optimal Bounds and Adversarial RobustnessElena Gribelyuk, Honghao Lin, David P. Woodruff, Huacheng Yu, Samson Zhou. 395-406 [doi]
• Efficient Algorithms and New Characterizations for CSP SparsificationSanjeev Khanna, Aaron Putterman, Madhu Sudan 0001. 407-416 [doi]
• Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical AlgorithmsSepehr Assadi, Sanjeev Khanna, Aaron Putterman. 417-428 [doi]
• Stabilizer Bootstrapping: A Recipe for Efficient Agnostic Tomography and Magic EstimationSitan Chen, Weiyuan Gong, Qi Ye, Zhihan Zhang. 429-438 [doi]
• Single-Copy Stabilizer TestingMarcel Hinsche, Jonas Helsen. 439-450 [doi]
• Distributed Quantum Advantage for Local ProblemsAlkida Balliu, Sebastian Brandt 0002, Xavier Coiteux-Roy, Francesco D'Amore 0001, Massimo Equi, François Le Gall, Henrik Lievonen, Augusto Modanese, Dennis Olivetti, Marc-Olivier Renou, Jukka Suomela, Lucas Tendick, Isadora Veeren. 451-462 [doi]
• The State Hidden Subgroup Problem and an Efficient Algorithm for Locating UnentanglementAdam Bouland, Tudor Giurgica-Tiron, John Wright. 463-470 [doi]
• Positive Bias Makes Tensor-Network Contraction TractableJiaqing Jiang, Jielun Chen, Norbert Schuch, Dominik Hangleiter. 471-482 [doi]
• Multi-parameter Mechanisms for Consumer Surplus MaximizationTomer Ezra, Daniel Schoepflin 0001, Ariel Shaulker. 483-494 [doi]
• Approximation Guarantees of Median Mechanism in ℝᵈNikolai Gravin, Jianhao Jia. 495-506 [doi]
• Monotone ContractionsEleni Batziou, John Fearnley, Spencer Gordon, Ruta Mehta, Rahul Savani. 507-517 [doi]
• Faster Rates for No-Regret Learning in General Games via Cautious OptimismAshkan Soleymani, Georgios Piliouras, Gabriele Farina. 518-529 [doi]
• Computational Lower Bounds for No-Regret Learning in Normal-Form GamesIoannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm. 530-541 [doi]
• Efficient Learning and Computation of Linear Correlated Equilibrium in General Convex GamesConstantinos Daskalakis, Gabriele Farina, Maxwell Fishelson, Charilaos Pipis, Jon Schneider. 542-553 [doi]
• The Structure of Catalytic Space: Capturing Randomness and Time via CompressionJames Cook, Jiatu Li, Ian Mertz, Edward Pyne. 554-564 [doi]
• Constant-Cost Communication Is Not Reducible to k-Hamming DistanceYuting Fang, Mika Göös, Nathaniel Harms, Pooya Hatami. 565-571 [doi]
• Refuting the Direct Sum Conjecture for Total Functions in Deterministic Communication ComplexitySimon Mackenzie, Abdallah Saffidine. 572-583 [doi]
• Lifting to Bounded-Depth and Regular Resolutions over Parities via GamesYaroslav Alekseev, Dmitry Itsykson. 584-595 [doi]
• Extractors for Samplable Distributions with Low Min-EntropyMarshall Ball, Ronen Shaltiel, Jad Silbak. 596-603 [doi]
• Leakage-Resilient Extractors against Number-on-Forehead ProtocolsEshan Chattopadhyay, Jesse Goodman. 604-614 [doi]
• A (2+ε)-Approximation Algorithm for Metric k-MedianVincent Cohen-Addad, Fabrizio Grandoni 0001, Euiwoong Lee, Chris Schwiegelshohn, Ola Svensson. 615-624 [doi]
• On Approximability of the Permanent of PSD MatricesFarzam Ebrahimnejad, Ansh Nagda, Shayan Oveis Gharan. 625-630 [doi]
• Rounding Large Independent Sets on ExpandersMitali Bafna, Jun-Ting Hsieh, Pravesh K. Kothari. 631-642 [doi]
• Optimal Rounding for Sparsest CutAlan Chang, Assaf Naor, Kevin Ren. 643-652 [doi]
• A 5/4-Approximation for Two-Edge ConnectivityMiguel Bosch Calvo, Mohit Garg 0003, Fabrizio Grandoni 0001, Felix Hommelsheim, Afrouz Jabal Ameli, Alexander Lindermayr. 653-664 [doi]
• Near-Optimal Dimension Reduction for Facility LocationLingxiao Huang, Shaofeng H.-C. Jiang, Robert Krauthgamer, Di Yue. 665-676 [doi]
• Locality vs Quantum CodesSamuel Dai, Ray Li. 677-688 [doi]
• Quantum LDPC Codes with Transversal Non-Clifford Gates via Products of Algebraic CodesLouis Golowich, Ting-Chun Lin. 689-696 [doi]
• Good Binary Quantum Codes with Transversal CCZ GateQuynh T. Nguyen. 697-706 [doi]
• Asymptotically Good Quantum Codes with Transversal Non-Clifford GatesLouis Golowich, Venkatesan Guruswami. 707-717 [doi]
• Pauli Measurements Are Not Optimal for Single-Copy TomographyJayadev Acharya, Abhilash Dharmavarapu, Yuhan Liu, Nengkun Yu. 718-729 [doi]
• Quantum Fault Tolerance with Constant-Space and Logarithmic-Time OverheadsQuynh T. Nguyen, Christopher A. Pattison. 730-737 [doi]
• Quantum Advantage from Soft DecodersAndré Chailloux, Jean-Pierre Tillich. 738-749 [doi]
• Asymptotic Tensor Rank Is Characterized by PolynomialsMatthias Christandl, Koen Hoeberechts, Harold Nieuwboer, Péter Vrana, Jeroen Zuiddam. 750-755 [doi]
• Computing Moment Polytopes of Tensors, with Applications in Algebraic Complexity and Quantum InformationMaxim van den Berg, Matthias Christandl, Vladimir Lysikov, Harold Nieuwboer, Michael Walter 0005, Jeroen Zuiddam. 756-765 [doi]
• On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials IV: Linear-Length Reductions and Their ApplicationsJoshua A. Grochow, Youming Qiao. 766-776 [doi]
• On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials V: Over Commutative RingsJoshua A. Grochow, Youming Qiao, Katherine E. Stange, Xiaorui Sun. 777-784 [doi]
• Error-Correction of Matrix Multiplication AlgorithmsShuichi Hirahara, Nobutaka Shimizu. 785-794 [doi]
• Matrix Chaos Inequalities and Chaos of Combinatorial TypeAfonso S. Bandeira, Kevin Lucca, Petar Nizic-Nikolac, Ramon van Handel. 795-805 [doi]
• How to Construct Random UnitariesFermi Ma, Hsin-Yuan Huang. 806-809 [doi]
• High Rate Multivariate Polynomial Evaluation CodesSwastik Kopparty, Mrinal Kumar 0001, Harry Sha. 810-821 [doi]
• Tensor Concentration Inequalities: A Geometric ApproachAfonso S. Bandeira, Sivakanth Gopi, Haotian Jiang, Kevin Lucca, Thomas Rothvoss. 822-832 [doi]
• Explicit Two-Sided Vertex Expanders beyond the Spectral BarrierJun-Ting Hsieh, Ting-Chun Lin, Sidhanth Mohanty, Ryan O'Donnell, Rachel Yun Zhang. 833-842 [doi]
• Explicit Codes Approaching Generalized Singleton Bound using ExpandersFernando Granha Jeronimo, Tushant Mittal, Shashank Srivastava, Madhur Tulsiani. 843-854 [doi]
• List-Decoding Capacity Implies Capacity on the q-ary Symmetric ChannelFrancisco Pernice, Oscar Sprumont, Mary Wootters. 855-866 [doi]
• Counting Random k-SAT near the Satisfiability ThresholdZongchen Chen, Aditya Lonkar, Chunyang Wang, Kuan Yang, Yitong Yin. 867-878 [doi]
• Rapid Mixing at the Uniqueness ThresholdXiaoyu Chen, Zongchen Chen, Yitong Yin, Xinyuan Zhang. 879-890 [doi]
• Sharp Phase Transitions in Estimation with Low-Degree PolynomialsYoungtak Sohn, Alexander S. Wein. 891-902 [doi]
• Phase Transitions via Complex Extensions of Markov ChainsJingcheng Liu 0001, Chunyang Wang, Yitong Yin, Yixiao Yu. 903-914 [doi]
• Weak Poincaré Inequalities, Simulated Annealing, and Sampling from Spherical Spin GlassesBrice Huang, Sidhanth Mohanty, Amit Rajaraman, David X. Wu. 915-923 [doi]
• Sampling and Integration of Logconcave Functions by Algorithmic DiffusionYunbum Kook, Santosh S. Vempala. 924-932 [doi]
• Universal SNARGs for NP from Proofs of CorrectnessZhengzhong Jin, Yael Tauman Kalai, Alex Lombardi, Surya Mathialagan. 933-943 [doi]
• Unambiguous SNARGs for P from LWE with Applications to PPAD HardnessLiyan Chen, Cody Freitag, Zhengzhong Jin, Daniel Wichs. 944-954 [doi]
• Succinct Non-interactive Arguments of ProximityLiyan Chen, Zhengzhong Jin, Daniel Wichs. 955-964 [doi]
• The Meta-complexity of Secret SharingBenny Applebaum, Oded Nir. 965-976 [doi]
• Fiat-Shamir in the Plain Model from Derandomization (Or: Do Efficient Algorithms Believe that NP = PSPACE?)Lijie Chen 0001, Ron D. Rothblum, Roei Tell. 977-985 [doi]
• A Zero-Knowledge PCP TheoremTom Gur, Jack O'Connor, Nicholas Spooner. 986-994 [doi]
• Testing Support Size More Efficiently Than Learning HistogramsRenato Ferreira Pinto Jr., Nathaniel Harms. 995-1006 [doi]
• Testing vs Estimation for Index-Invariant Properties in the Huge Object ModelSourav Chakraborty 0001, Eldar Fischer, Arijit Ghosh, Amit Levi, Gopinath Mishra, Sayantan Sen. 1007-1018 [doi]
• Monotonicity Testing of High-Dimensional Distributions with Subcube ConditioningDeeparnab Chakrabarty, Xi Chen, Simeon Ristic, C. Seshadhri 0001, Erik Waingarten. 1019-1030 [doi]
• A Tolerant Independent Set TesterCameron Seth. 1031-1042 [doi]
• Approximately Counting and Sampling Hamiltonian Motifs in Sublinear TimeTalya Eden, Reut Levi, Dana Ron, Ronitt Rubinfeld. 1043-1054 [doi]
• Stochastic Matching via In-n-Out Local Computation AlgorithmsAmir Azarmehr, Soheil Behnezhad, Alma Ghafari, Ronitt Rubinfeld. 1055-1066 [doi]
• Characterizing and Testing Principal Minor Equivalence of MatricesAbhranil Chatterjee 0001, Sumanta Ghosh, Rohit Gurjar, Roshan Raj. 1067-1078 [doi]
• Primes via Zeros: Interactive Proofs for Testing Primality of Natural Classes of IdealsAbhibhav Garg, Rafael Oliveira 0002, Nitin Saxena 0001. 1079-1086 [doi]
• Polynomial-Time PIT from (Almost) Necessary AssumptionsRobert Andrews 0003, Deepanshu Kush, Roei Tell. 1087-1095 [doi]
• Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting SetsAlbert Atserias, Iddo Tzameret. 1096-1107 [doi]
• When Connectivity Is Hard, Random Walks Are Easy with Non-determinismDean Doron, Edward Pyne, Roei Tell, R. Ryan Williams. 1108-1117 [doi]
• Vanishing of Schubert CoefficientsIgor Pak, Colleen Robichaux. 1118-1129 [doi]
• Extending the Extension: Deterministic Algorithm for Non-monotone Submodular MaximizationNiv Buchbinder, Moran Feldman. 1130-1141 [doi]
• Better Approximation for Weighted k-Matroid IntersectionNeta Singer, Theophile Thiery. 1142-1153 [doi]
• Solving the Correlation Cluster LP in Sublinear TimeNairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li 0001, David Rasmussen Lolck, Alantha Newman, Mikkel Thorup, Lukas Vogl, Shuyi Yan, Hanwen Zhang 0003. 1154-1165 [doi]
• Fully Dynamic k-Median with Near-Optimal Update Time and RecourseSayan Bhattacharya, Martín Costa, Ermiya Farokhnejad. 1166-1177 [doi]
• Dynamic Locality Sensitive Orderings in Doubling MetricsAn La, Hung Le 0001. 1178-1189 [doi]
• Near-Optimal Linear Sketches and Fully-Dynamic Algorithms for Hypergraph Spectral SparsificationSanjeev Khanna, Huan Li 0002, Aaron Putterman. 1190-1200 [doi]
• Learning the Structure of Any Hamiltonian from Minimal AssumptionsAndrew Zhao. 1201-1211 [doi]
• Learning the Closest Product StateAinesh Bakshi, John Bostanci, William Kretschmer, Zeph Landau, Jerry Li 0001, Allen Liu, Ryan O'Donnell, Ewin Tang. 1212-1221 [doi]
• Improved Bounds for Testing Low Stabilizer Complexity StatesSaeed Mehraban, Mehrdad Tahmasbi. 1222-1233 [doi]
• Polynomial-Time Tolerant Testing Stabilizer StatesSrinivasan Arunachalam, Arkopal Dutt. 1234-1241 [doi]
• Dimension Independent and Computationally Efficient Shadow TomographyPulkit Sinha. 1242-1253 [doi]
• Tolerant Testing of Stabilizer States with a Polynomial Gap via a Generalized Uncertainty RelationZongbo Bao, Philippe van Dordrecht, Jonas Helsen. 1254-1262 [doi]
• Testing and Learning Structured Quantum HamiltoniansSrinivasan Arunachalam, Arkopal Dutt, Francisco Escudero Gutiérrez. 1263-1270 [doi]
• On the Locality of the Lovász Local LemmaPeter Davies-Peck. 1271-1282 [doi]
• History-Independent Concurrent Hash TablesHagit Attiya, Michael A. Bender, Martín Farach-Colton, Rotem Oshman, Noa Schiller. 1283-1294 [doi]
• Online Locality Meets Distributed Quantum ComputingAmirreza Akbari, Xavier Coiteux-Roy, Francesco D'Amore 0001, François Le Gall, Henrik Lievonen, Darya Melnyk, Augusto Modanese, Shreyas Pai, Marc-Olivier Renou, Václav Rozhon, Jukka Suomela. 1295-1306 [doi]
• Faster Distributed Δ-Coloring via Ruling SubgraphsYann Bourreau, Sebastian Brandt, Alexandre Nolin. 1307-1318 [doi]
• Constant Degree Networks for Almost-Everywhere Reliable TransmissionMitali Bafna, Dor Minzer. 1319-1328 [doi]
• Optimal Proof Systems for Complex Sets Are Hard to FindFabian Egidy, Christian Glaßer. 1329-1340 [doi]
• Student-Teacher Constructive Separations and (Un)Provability in Bounded Arithmetic: Witnessing the GapStefan Grosser, Marco Carmosino. 1341-1347 [doi]
• Maximum Circuit Lower Bounds for Exponential-Time Arthur MerlinLijie Chen 0001, Jiatu Li, Jingxun Liang. 1348-1358 [doi]
• Supercritical Tradeoffs for Monotone CircuitsMika Göös, Gilbert Maystre, Kilian Risse, Dmitry Sokolov 0001. 1359-1370 [doi]
• Truly Supercritical Trade-Offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-LemanSusanna F. de Rezende, Noah Fleming, Duri Andrea Janett, Jakob Nordström, Shuo Pang 0002. 1371-1382 [doi]
• Low Rank Matrix Rigidity: Tight Lower Bounds and Hardness AmplificationJosh Alman, Jingxun Liang. 1383-1394 [doi]
• Constant Approximation for Weighted Nash Social Welfare with Submodular ValuationsYuda Feng, Yang Hu, Shi Li 0001, Ruilong Zhang 0001. 1395-1405 [doi]
• The Cost of Consistency: Submodular Maximization with Constant RecoursePaul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson, Morteza Zadimoghaddam. 1406-1417 [doi]
• Tight Results for Online Convex PagingAnupam Gupta 0001, Amit Kumar 0001, Debmalya Panigrahi. 1418-1429 [doi]
• Online Stochastic Matching with Unknown Arrival Order: Beating 0.5 against the Online OptimumEnze Sun 0001, Zhihao Gavin Tang, Yifan Wang. 1430-1441 [doi]
• Single-Sample and Robust Online Resource AllocationRohan Ghuge, Sahil Singla 0001, Yifan Wang. 1442-1453 [doi]
• Adaptive Approximation Schemes for Matching QueuesAlireza Amanihamedani, Ali Aouad, Amin Saberi. 1454-1464 [doi]
• Quantum Communication Advantage in TFNPMika Göös, Tom Gur, Siddhartha Jain 0002, Jiawei Li. 1465-1475 [doi]
• On the Computational Power of QAC0 with Barely Superlinear AncillaeAnurag Anshu, Yangjing Dong, Fengning Ou, Penghui Yao. 1476-1487 [doi]
• Efficient Thermalization and Universal Quantum Computing with Quantum Gibbs SamplersCambyse Rouzé, Daniel Stilck França, Álvaro M. Alhambra. 1488-1495 [doi]
• The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and DepthGregory D. Kahanamoku-Meyer, Seyoon Ragavan, Vinod Vaikuntanathan, Katherine Van Kirk. 1496-1507 [doi]
• Permutation Superposition Oracles for Quantum Query Lower BoundsChristian Majenz, Giulio Malavolta, Michael Walter. 1508-1519 [doi]
• QMA vs QCMA and PseudorandomnessJiahui Liu, Saachi Mutreja, Henry Yuen. 1520-1531 [doi]
• Tractable Agreement ProtocolsNatalie Collina, Surbhi Goel, Varun Gupta 0006, Aaron Roth 0001. 1532-1543 [doi]
• Share-Based Fairness for Arbitrary EntitlementsMoshe Babaioff, Uriel Feige. 1544-1555 [doi]
• From Signaling to Interviews in Random Matching MarketsMaxwell Allman, Itai Ashlagi, Amin Saberi, Sophie H. Yu. 1556-1567 [doi]
• Metric Distortion of Small-Group DeliberationAshish Goel, Mohak Goyal, Kamesh Munagala. 1568-1579 [doi]
• Constant-Factor EFX Exists for ChoresJugal Garg, Aniket Murhekar, John Qin. 1580-1589 [doi]
• Six Candidates Suffice to Win a Voter MajorityMoses Charikar, Alexandra Lassota, Prasanna Ramakrishnan, Adrian Vetta, Kangning Wang 0001. 1590-1601 [doi]
• Time and Space Efficient Deterministic DecodersJoshua Cook, Dana Moshkovitz. 1602-1613 [doi]
• Redundancy Is All You NeedJoshua Brakensiek, Venkatesan Guruswami. 1614-1625 [doi]
• Strong XOR Lemma for Information ComplexityPachara Sawettamalya, Huacheng Yu. 1626-1637 [doi]
• Ideal Pseudorandom CodesOmar Alrabiah, Prabhanjan Ananth, Miranda Christ, Yevgeniy Dodis, Sam Gunn. 1638-1647 [doi]
• Improved PIR Schemes using Matching Vectors and DerivativesFatemeh Ghasemi, Swastik Kopparty, Madhu Sudan 0001. 1648-1656 [doi]
• A Generalized Trace Reconstruction Problem: Recovering a String of ProbabilitiesJoey Rivkin, Gregory Valiant, Paul Valiant. 1657-1667 [doi]
• Discrepancy Algorithms for the Binary PerceptronShuangping Li, Tselil Schramm, Kangjie Zhou. 1668-1679 [doi]
• Entangled Mean Estimation in High DimensionsIlias Diakonikolas, Daniel M. Kane, Sihan Liu, Thanasis Pittas. 1680-1688 [doi]
• SoS Certifiability of Subgaussian Distributions and Its Algorithmic ApplicationsIlias Diakonikolas, Samuel B. Hopkins, Ankit Pensia, Stefan Tiegel. 1689-1700 [doi]
• SoS Certificates for Sparse Singular Values and Their Applications: Robust Statistics, Subspace Distortion, and MoreIlias Diakonikolas, Samuel B. Hopkins, Ankit Pensia, Stefan Tiegel. 1701-1709 [doi]
• How Random CSPs Fool Hierarchies: IISiu On Chan, Hiu Tsun Ng. 1710-1721 [doi]
• Coboundary Expansion of Coset ComplexesTali Kaufman, Izhar Oppenheim, Shmuel Weinberger. 1722-1731 [doi]
• On the Limits of Language Generation: Trade-Offs between Hallucination and Mode-CollapseAlkis Kalavasis, Anay Mehrotra, Grigoris Velegkas. 1732-1743 [doi]
• Provably Learning a Multi-head Attention LayerSitan Chen, Yuanzhi Li. 1744-1754 [doi]
• Model Stealing for Any Low-Rank Language ModelAllen Liu, Ankur Moitra. 1755-1761 [doi]
• Omnipredicting Single-Index Models with Multi-index ModelsLunjia Hu, Kevin Tian, Chutong Yang. 1762-1773 [doi]
• Learning the Sherrington-Kirkpatrick Model Even at Low TemperatureGautam Chandrasekaran, Adam R. Klivans. 1774-1784 [doi]
• Oblivious Defense in ML Models: Backdoor Removal without DetectionShafi Goldwasser, Jonathan Shafer, Neekon Vafa, Vinod Vaikuntanathan. 1785-1794 [doi]
• The FPᴺᴾ versus #P Dichotomy for #EOBoning Meng, Juqiu Wang, Mingji Xia. 1795-1806 [doi]
• Locally Sampleable Uniform Symmetric DistributionsDaniel M. Kane, Anthony Ostuni, Kewen Wu 0001. 1807-1816 [doi]
• Uncloneable Quantum States Are Necessary as Proofs and AdviceRohit Chatterjee, Srijita Kundu, Supartha Podder. 1817-1827 [doi]
• Learning Quantum States Prepared by Shallow Circuits in Polynomial TimeZeph Landau, Yunchao Liu 0002. 1828-1838 [doi]
• The 2-Token Theorem: Recognising History-Deterministic Parity Automata EfficientlyKaroliina Lehtinen, Aditya Prakash 0002. 1839-1850 [doi]
• Reachability in One-Dimensional Pushdown Vector Addition Systems Is DecidableClotilde Bizière, Wojciech Czerwinski. 1851-1862 [doi]
• Cryptographic Characterization of Quantum AdvantageTomoyuki Morimae, Yuki Shirakawa, Takashi Yamakawa. 1863-1874 [doi]
• Succinct Oblivious Tensor Evaluation and Applications: Adaptively-Secure Laconic Function Evaluation and Trapdoor Hashing for All CircuitsDamiano Abram, Giulio Malavolta, Lawrence Roy. 1875-1886 [doi]
• Protecting Computations against Continuous Bounded-Communication LeakageYuval Ishai, Yifan Song 0001. 1887-1897 [doi]
• A New Approach for LPN-Based Pseudorandom Functions: Low-Depth and Key-HomomorphicYoulong Ding, Aayush Jain, Ilan Komargodski. 1898-1909 [doi]
• Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear EquationsKiril Bangachev, Guy Bresler, Stefan Tiegel, Vinod Vaikuntanathan. 1910-1920 [doi]
• Using the Planted Clique Conjecture for Cryptography: Public-Key Encryption from Planted Clique and Noisy k-LIN over ExpandersRiddhi Ghosal, Isaac M. Hair, Aayush Jain, Amit Sahai. 1921-1932 [doi]
• Disjoint Paths Problem with Group-Expressable ConstraintsChun-Hung Liu, Youngho Yoo. 1933-1943 [doi]
• Merge-Width and First-Order Model CheckingJan Dreier, Szymon Torunczyk. 1944-1955 [doi]
• All-Pairs Shortest Paths with Few Weights per NodeAmir Abboud, Nick Fischer, Ce Jin 0001, Virginia Vassilevska Williams, Zoe Xi. 1956-1964 [doi]
• Efficiently Finding and Counting Patterns with Distance Constraints in Sparse GraphsDaniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Jie Xue 0003, Meirav Zehavi. 1965-1974 [doi]
• Subexponential Parameterized Algorithms for Hitting SubgraphsDaniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Jie Xue, Meirav Zehavi. 1975-1984 [doi]
• Output-Sensitive Approximate Counting via a Measure-Bounded Hyperedge Oracle, or: How Asymmetry Helps Estimate k-Clique Counts FasterKeren Censor Hillel, Tomer Even, Virginia Vassilevska Williams. 1985-1996 [doi]
• Agnostic Smoothed Online LearningMoïse Blanchard. 1997-2006 [doi]
• Breaking the T^(2/3) Barrier for Sequential CalibrationYuval Dagan, Constantinos Daskalakis, Maxwell Fishelson, Noah Golowich, Robert Kleinberg, Princewill Okoroafor. 2007-2018 [doi]
• Almost Optimal PAC Learning for k-MeansVincent Cohen-Addad, Silvio Lattanzi, Chris Schwiegelshohn. 2019-2030 [doi]
• Adaptive and Oblivious Statistical Adversaries Are EquivalentGuy Blanc, Gregory Valiant. 2031-2042 [doi]
• On Reductions and Representations of Learning Problems in Euclidean SpacesBogdan Chornomaz, Shay Moran, Tom Waknine. 2043-2054 [doi]
• DNF Learning via Locally Mixing Random WalksJosh Alman, Shivam Nadimpalli, Shyamal Patel, Rocco A. Servedio. 2055-2061 [doi]
• Weak Recovery, Hypothesis Testing, and Mutual Information in Stochastic Block Models and Planted Factor GraphsElchanan Mossel, Allan Sly, Youngtak Sohn. 2062-2073 [doi]
• Matroid Products via Submodular CouplingKristóf Bérczi, Boglárka Gehér, András Imolay, László Lovász 0001, Balázs Maga, Tamás Schwarcz. 2074-2085 [doi]
• Long Arithmetic Progressions in Sumsets and Subset Sums: Constructive Proofs and Efficient WitnessesLin Chen, Yuchen Mao 0001, Guochuan Zhang. 2086-2097 [doi]
• Smoothed Analysis for Graph IsomorphismMichael Anastos, Matthew Kwan 0001, Benjamin Moore. 2098-2106 [doi]
• Statistical Inference of a Ranked Community in a Directed GraphDmitriy Kunisky, Daniel A. Spielman, Alexander S. Wein, Xifan Yu. 2107-2117 [doi]
• Near Optimal Constant Inapproximability under ETH for Fundamental Problems in Parameterized ComplexityMitali Bafna, Karthik C. S., Dor Minzer. 2118-2129 [doi]
• Treewidth Inapproximability and Tight ETH Lower BoundÉdouard Bonnet. 2130-2135 [doi]
• Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETHVenkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu 0001. 2136-2144 [doi]
• A Fine-Grained Classification of Subquadratic Patterns for Subgraph Listing and FriendsKarl Bringmann, Egor Gorbachev. 2145-2156 [doi]
• Bounded Edit Distance: Optimal Static and Dynamic Algorithms for Small Integer WeightsEgor Gorbachev, Tomasz Kociumaka. 2157-2166 [doi]
• Faster Weighted and Unweighted Tree Edit Distance and APSP EquivalenceJakob Nogler, Adam Polak 0001, Barna Saha, Virginia Vassilevska Williams, Yinzhan Xu, Christopher Ye 0001. 2167-2178 [doi]
• Faster Lattice Basis Computation via a Natural Generalization of the Euclidean AlgorithmKim-Manuel Klein, Janina Reuter. 2179-2190 [doi]
• Symmetric Perceptrons, Number Partitioning and LatticesNeekon Vafa, Vinod Vaikuntanathan. 2191-2202 [doi]
• Accelerated Approximate Optimization of Multi-commodity Flows on Directed GraphsLi Chen 0028, Andrei Graur, Aaron Sidford. 2203-2212 [doi]
• Breaking the Barrier of Self-Concordant Barriers: Faster Interior Point Methods for M-MatricesAdrian Vladu. 2213-2224 [doi]
• Improved Complexity for Smooth Nonconvex Optimization: A Two-Level Online Learning Approach with Quasi-Newton MethodsRuichen Jiang, Aryan Mokhtari, Francisco Patitucci. 2225-2236 [doi]
• Fast, Robust Approximate Message PassingMisha Ivkov, Tselil Schramm. 2237-2248 [doi]
• Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar GraphsItai Boneh, Shiri Chechik, Shay Golan 0001, Shay Mozes, Oren Weimann. 2249-2256 [doi]
• Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling GraphsHsien-Chih Chang, Jonathan Conroy, Hung Le 0001, Shay Solomon, Cuong Than. 2257-2268 [doi]
• Covering Approximate Shortest Paths with DAGsSepehr Assadi, Gary Hoppenworth, Nicole Wein. 2269-2280 [doi]
• How to Protect Yourself from Threatening Skeletons: Optimal Padded Decompositions for Minor-Free GraphsJonathan Conroy, Arnold Filtser. 2281-2292 [doi]
• Deterministic Vertex Connectivity via Common-Neighborhood Clustering and PseudorandomnessYonggang Jiang, Chaitanya Nalam, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai. 2293-2304 [doi]
• Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions and Near-Optimal SeparationsJoakim Blikstad, Yonggang Jiang, Sagnik Mukhopadhyay, Sorrachai Yingchareonthawornchai. 2305-2316 [doi]
• Approximation Algorithms for the Geometric Multimatching ProblemShinwoo An, Eunjin Oh 0001, Jie Xue 0003. 2317-2328 [doi]
• Constant Approximation of Fréchet Distance in Strongly Subquadratic TimeSiu-Wing Cheng, Haoqiang Huang, Shuo Zhang. 2329-2340 [doi]
• Sample-Optimal Private Regression in Polynomial TimePrashanti Anderson, Ainesh Bakshi, Mahbod Majid, Stefan Tiegel. 2341-2349 [doi]
• Privately Evaluating Untrusted Black-Box FunctionsEphraim Linder, Sofya Raskhodnikova, Adam D. Smith, Thomas Steinke 0002. 2350-2361 [doi]
• On Differentially Private Linear AlgebraHaim Kaplan, Yishay Mansour, Shay Moran, Uri Stemmer, Nitzan Tur. 2362-2373 [doi]
• Fingerprinting Codes Meet Geometry: Improved Lower Bounds for Private Query Release and Adaptive Data AnalysisXin Lyu, Kunal Talwar. 2374-2385 [doi]