Table of Contents

• The Computer in the Sky (Keynote)Tim Roughgarden. 1 [doi]
• Algorithmic Contract Design (Keynote)Michal Feldman. 2 [doi]
• 8/9) TimeJeremy T. Fineman. 3-14 [doi]
• Near Optimal Alphabet-Soundness Tradeoff PCPsDor Minzer, Kai Zhe Zheng. 15-23 [doi]
• Parameterized Inapproximability Hypothesis under Exponential Time HypothesisVenkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu 0001. 24-35 [doi]
• Online Edge Coloring Is (Nearly) as Easy as OfflineJoakim Blikstad, Ola Svensson, Radu Vintan, David Wajc. 36-46 [doi]
• Approximate Earth Mover's Distance in Truly-Subquadratic TimeLorenzo Beretta 0001, Aviad Rubinstein. 47-58 [doi]
• Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite GraphsSayan Bhattacharya, Peter Kiss, Aaron Sidford, David Wajc. 59-70 [doi]
• Low-Step Multi-commodity Flow EmulatorsBernhard Haeupler, D. Ellis Hershkowitz, Jason Li 0006, Antti Roeyskoe, Thatchaphol Saranurak. 71-82 [doi]
• 2+o(1) Time via a Combinatorial AlgorithmJulia Chuzhoy, Sanjeev Khanna. 83-94 [doi]
• Strong Algebras and Radical Sylvester-Gallai ConfigurationsRafael Oliveira 0006, Akash Kumar Sengupta. 95-105 [doi]
• Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial TimeVikraman Arvind, Abhranil Chatterjee 0001, Partha Mukhopadhyay. 106-117 [doi]
• The Minimal Faithful Permutation Degree of Groups without Abelian Normal SubgroupsBireswar Das, Dhara Thakkar. 118-129 [doi]
• Learning the Coefficients: A Presentable Version of Border Complexity and Applications to Circuit FactoringC. S. Bhargav, Prateek Dwivedi 0001, Nitin Saxena 0001. 130-140 [doi]
• On the Power of Homogeneous Algebraic FormulasHervé Fournier, Nutan Limaye, Srikanth Srinivasan 0001, Sébastien Tavenas. 141-151 [doi]
• Super Non-singular Decompositions of Polynomials and Their Application to Robustly Learning Low-Degree PTFsIlias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Sihan Liu, Nikos Zarifis. 152-159 [doi]
• Calibrated Language Models Must HallucinateAdam Tauman Kalai, Santosh S. Vempala. 160-171 [doi]
• Private Graphon Estimation via Sum-of-SquaresHongjie Chen, Jingqiu Ding, Tommaso d'Orsi, Yiding Hua, Chih-Hung Liu 0001, David Steurer. 172-182 [doi]
• Exploring and Learning in Sparse Linear MDPs without Computationally Intractable OraclesNoah Golowich, Ankur Moitra, Dhruv Rohatgi. 183-193 [doi]
• Near-Optimal Mean Estimation with Unknown, Heteroskedastic VariancesSpencer Compton, Gregory Valiant. 194-200 [doi]
• The Power of Two-Sided Recruitment in Two-Sided MarketsYang Cai 0001, Christopher Liaw, Aranyak Mehta, Mingfei Zhao. 201-212 [doi]
• Strategic Budget Selection in a Competitive Autobidding WorldYiding Feng, Brendan Lucier, Aleksandrs Slivkins. 213-224 [doi]
• The Role of Transparency in Repeated First-Price Auctions with Unknown ValuationsNicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi 0001. 225-236 [doi]
• Bilateral Trade with Correlated ValuesShahar Dobzinski, Ariel Shaulker. 237-246 [doi]
• No-Regret Learning in Bilateral Trade via Global Budget BalanceMartino Bernasconi, Matteo Castiglioni, Andrea Celli, Federico Fusco. 247-258 [doi]
• Knapsack with Small Items in Near-Quadratic TimeKarl Bringmann. 259-270 [doi]
• 0-1 Knapsack in Nearly Quadratic TimeCe Jin. 271-282 [doi]
• A Nearly Quadratic-Time FPTAS for KnapsackLin Chen 0009, Jiayi Lian, Yuchen Mao, Guochuan Zhang. 283-294 [doi]
• (1 - ε)-Approximation of Knapsack in Nearly Quadratic TimeXiao Mao. 295-306 [doi]
• Approximating Partition in Near-Linear TimeLin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang. 307-318 [doi]
• Approximating Small Sparse CutsAditya Anand 0001, Euiwoong Lee, Jason Li 0006, Thatchaphol Saranurak. 319-330 [doi]
• Better Coloring of 3-Colorable GraphsKen-ichi Kawarabayashi, Mikkel Thorup, Hirotaka Yoneda. 331-339 [doi]
• Testing Closeness of Multivariate Distributions via Ramsey TheoryIlias Diakonikolas, Daniel M. Kane, Sihan Liu. 340-347 [doi]
• Semidefinite Programs Simulate Approximate Message Passing RobustlyMisha Ivkov, Tselil Schramm. 348-357 [doi]
• Planted Clique Conjectures Are EquivalentShuichi Hirahara, Nobutaka Shimizu. 358-366 [doi]
• Robust Recovery for Stochastic Block Models, Simplified and GeneralizedSidhanth Mohanty, Prasad Raghavendra, David X. Wu. 367-374 [doi]
• New Tools for Smoothed Analysis: Least Singular Value Bounds for Random Matrices with Dependent EntriesAditya Bhaskara, Eric Evert, Vaidehi Srinivas, Aravindan Vijayaraghavan. 375-386 [doi]
• Adaptively-Sound Succinct Arguments for NP from Indistinguishability ObfuscationBrent Waters, David J. Wu 0001. 387-398 [doi]
• A New Approach for Non-Interactive Zero-Knowledge from Learning with ErrorsBrent Waters. 399-410 [doi]
• Optimal Load-Balanced Scalable Distributed AgreementYuval Gelles, Ilan Komargodski. 411-422 [doi]
• Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice-Based SNARKsThomas Debris-Alazard, Pouria Fallahpour, Damien Stehlé. 423-434 [doi]
• Batch Proofs Are Statistically HidingNir Bitansky, Chethan Kamath, Omer Paneth, Ron D. Rothblum, Prashant Nalini Vasudevan. 435-443 [doi]
• Approximating Maximum Matching Requires Almost Quadratic TimeSoheil Behnezhad, Mohammad Roghani, Aviad Rubinstein. 444-454 [doi]
• Structural Complexities of Matching MechanismsYannai A. Gonczarowski, Clayton Thomas. 455-466 [doi]
• A Constant-Factor Approximation for Nash Social Welfare with Subadditive ValuationsShahar Dobzinski, Wenzheng Li, Aviad Rubinstein, Jan Vondrák. 467-478 [doi]
• Limitations of Stochastic Selection Problems with Pairwise Independent PriorsShaddin Dughmi, Yusuf Hakan Kalayci, Neel Patel. 479-490 [doi]
• Prophet Inequalities Require Only a Constant Number of SamplesAndrés Cristi, Bruno Ziliotto. 491-502 [doi]
• A Unified Approach to Learning Ising Models: Beyond Independence and Bounded WidthJason Gaitonde, Elchanan Mossel. 503-514 [doi]
• Nonlinear Dynamics for the Ising ModelPietro Caputo, Alistair Sinclair. 515-526 [doi]
• Influences in Mixing MeasuresFrederic Koehler, Noam Lifshitz, Dor Minzer, Elchanan Mossel. 527-536 [doi]
• Parallel Sampling via CountingNima Anari, Ruiquan Gao, Aviad Rubinstein. 537-548 [doi]
• On the Fourier Coefficients of High-Dimensional Random Geometric GraphsKiril Bangachev, Guy Bresler. 549-560 [doi]
• Classical Simulation of Peaked Shallow Quantum CircuitsSergey Bravyi 0001, David Gosset, Yinchen Liu. 561-572 [doi]
• Quantum and Classical Query Complexities of Functions of MatricesAshley Montanaro, Changpeng Shao. 573-584 [doi]
• Circuit-to-Hamiltonian from Tensor Networks and Fault ToleranceAnurag Anshu, Nikolas P. Breuckmann, Quynh T. Nguyen. 585-595 [doi]
• Quantum Time-Space Tradeoffs for Matrix ProblemsPaul Beame, Niels Kornerup, Michael Whitmeyer. 596-607 [doi]
• Quadratic Lower Bounds on the Approximate Stabilizer Rank: A Probabilistic ApproachSaeed Mehraban, Mehrdad Tahmasbi. 608-619 [doi]
• Hardness of Range Avoidance and Remote Point for Restricted Circuits via CryptographyYilei Chen, Jiatu Li. 620-629 [doi]
• Communication Lower Bounds for Collision Problems via Density Increment ArgumentsGuangxu Yang, Jiapeng Zhang. 630-639 [doi]
• Lower Bounds for Regular Resolution over ParitiesKlim Efremenko, Michal Garlík, Dmitry Itsykson. 640-651 [doi]
• XOR Lemmas for Communication via Marginal InformationSiddharth Iyer, Anup Rao 0001. 652-658 [doi]
• Beating Brute Force for Compression ProblemsShuichi Hirahara, Rahul Ilango, R. Ryan Williams. 659-670 [doi]
• Optimization with Pattern-Avoiding InputBenjamin Aram Berendsohn, László Kozma 0002, Michal Opler. 671-682 [doi]
• Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial TimePeter Gartland, Daniel Lokshtanov, Tomás Masarík, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski. 683-691 [doi]
• Packing Even Directed Circuits Quarter-IntegrallyMaximilian Gorsky, Ken-ichi Kawarabayashi, Stephan Kreutzer, Sebastian Wiederrecht. 692-703 [doi]
• Edge-Disjoint Paths in Eulerian DigraphsDario Giuliano Cavallaro, Ken-ichi Kawarabayashi, Stephan Kreutzer. 704-715 [doi]
• A Flat Wall Theorem for Matching Minors in Bipartite GraphsArchontia C. Giannopoulou, Sebastian Wiederrecht. 716-727 [doi]
• Generalized GM-MDS: Polynomial Codes Are Higher Order MDSJoshua Brakensiek, Manik Dhar, Sivakanth Gopi. 728-739 [doi]
• AG Codes Achieve List Decoding Capacity over Constant-Sized FieldsJoshua Brakensiek, Manik Dhar, Sivakanth Gopi, Zihan Zhang. 740-751 [doi]
• Constant Query Local Decoding against Deletions Is ImpossibleMeghal Gupta. 752-763 [doi]
• Local Correction of Linear Functions over the Boolean CubePrashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan 0001, Madhu Sudan 0001. 764-775 [doi]
• An Exponential Lower Bound for Linear 3-Query Locally Correctable CodesPravesh K. Kothari, Peter Manohar. 776-787 [doi]
• Explicit Two-Sided Unique-Neighbor ExpandersJun-Ting Hsieh, Theo McKenzie, Sidhanth Mohanty, Pedro Paredes 0002. 788-799 [doi]
• Data-Dependent LSH for the Earth Mover's DistanceRajesh Jayaram, Erik Waingarten, Tian Zhang. 800-811 [doi]
• Polylog-Competitive Deterministic Local Routing and SchedulingBernhard Haeupler, Shyamal Patel, Antti Roeyskoe, Cliff Stein 0001, Goran Zuzic. 812-822 [doi]
• Connectivity Labeling and Routing with Multiple Vertex FailuresMerav Parter, Asaf Petruschka, Seth Pettie. 823-834 [doi]
• Optimal Multi-pass Lower Bounds for MST in Dynamic StreamsSepehr Assadi, Gillat Kol, Zhijun Zhang 0007. 835-846 [doi]
• O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent SetSepehr Assadi, Christian Konrad 0001, Kheeran K. Naidu, Janani Sundaresan. 847-858 [doi]
• The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both TrueAndreas Björklund, Petteri Kaski. 859-870 [doi]
• A Stronger Connection between the Asymptotic Rank Conjecture and the Set Cover ConjectureKevin Pratt. 871-874 [doi]
• Equality Cases of the Alexandrov-Fenchel Inequality Are Not in the Polynomial HierarchySwee Hong Chan, Igor Pak. 875-883 [doi]
• Semigroup Algorithmic Problems in Metabelian GroupsRuiwen Dong 0001. 884-891 [doi]
• The Complexity of Computing KKT Solutions of Quadratic ProgramsJohn Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani. 892-903 [doi]
• Minimum Star Partitions of Simple Polygons in Polynomial TimeMikkel Abrahamsen, Joakim Blikstad, André Nusser, Hanwen Zhang. 904-910 [doi]
• Revisiting Local Computation of PageRank: Simple and OptimalHanzhi Wang, Zhewei Wei, Ji-Rong Wen, Mingji Yang 0001. 911-922 [doi]
• Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller CliquesMina Dalirrooyfard, Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu. 923-934 [doi]
• New Graph Decompositions and Combinatorial Boolean Matrix Multiplication AlgorithmsAmir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, Raghu Meka. 935-943 [doi]
• Nearly Optimal Fault Tolerant Distance OracleDipan Dey, Manoj Gupta 0002. 944-955 [doi]
• Almost Linear Size Edit Distance SketchMichal Koucký 0002, Michael E. Saks. 956-967 [doi]
• Commitments from Quantum One-WaynessDakshita Khurana, Kabir Tomer. 968-978 [doi]
• A One-Query Lower Bound for Unitary Synthesis and Breaking Quantum CryptographyAlex Lombardi, Fermi Ma, John Wright. 979-990 [doi]
• Two Prover Perfect Zero Knowledge for MIPKieran Mastel, William Slofstra. 991-1002 [doi]
• How to Use Quantum Indistinguishability ObfuscationAndrea Coladangelo, Sam Gunn. 1003-1008 [doi]
• Quantum State Obfuscation from Classical OraclesJames Bartusek, Zvika Brakerski, Vinod Vaikuntanathan. 1009-1017 [doi]
• Nonlocality under Computational AssumptionsGrzegorz Gluch, Khashayar Barooti, Alexandru Gheorghiu, Marc-Olivier Renou. 1018-1026 [doi]
• Detecting Low-Degree TruncationAnindya De, Huan Li 0002, Shivam Nadimpalli, Rocco A. Servedio. 1027-1038 [doi]
• Optimal Non-adaptive Tolerant Junta Testing via Local EstimatorsShivam Nadimpalli, Shyamal Patel. 1039-1050 [doi]
• Distribution-Free Testing of Decision Lists with a Sublinear Number of QueriesXi Chen, Yumou Fei, Shyamal Patel. 1051-1062 [doi]
• On the Power of Interactive Proofs for LearningTom Gur, Mohammad Mahdi Jahanara, Mohammad Mahdi Khodabandeh, Ninad Rajgopal, Bahar Salamatian, Igor Shinkar. 1063-1070 [doi]
• Complexity-Theoretic Implications of MulticalibrationSílvia Casacuberta, Cynthia Dwork, Salil P. Vadhan. 1071-1082 [doi]
• Local Geometry of NAE-SAT Solutions in the Condensation RegimeAllan Sly, Youngtak Sohn. 1083-1093 [doi]
• Trickle-Down in Localization Schemes and ApplicationsNima Anari, Frederic Koehler, Thuy Duong Vuong. 1094-1105 [doi]
• Optimal Embedding Dimension for Sparse Subspace EmbeddingsShabarish Chenakkod, Michal Derezinski, Xiaoyu Dong, Mark Rudelson. 1106-1117 [doi]
• Solving Dense Linear Systems Faster Than via PreconditioningMichal Derezinski, Jiaming Yang. 1118-1129 [doi]
• Improving the Bit Complexity of Communication for Distributed Convex OptimizationMehrdad Ghadiri, Yin Tat Lee, Swati Padmanabhan, William Swartworth, David P. Woodruff, Guanghao Ye. 1130-1140 [doi]
• Fully Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update TimeXiao Mao. 1141-1152 [doi]
• Space Lower Bounds for Dynamic Filters and Value-Dynamic RetrievalWilliam Kuszmaul, Stefan Walzer. 1153-1164 [doi]
• Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost FlowLi Chen 0028, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg. 1165-1173 [doi]
• A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their ApplicationsRasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg. 1174-1183 [doi]
• Dynamic O(Arboricity) Coloring in Polylogarithmic Worst-Case TimeMohsen Ghaffari 0001, Christoph Grunau. 1184-1191 [doi]
• Settling the Communication Complexity of VCG-Based Mechanisms for All Approximation GuaranteesFrederick V. Qiu, S. Matthew Weinberg. 1192-1203 [doi]
• PPAD-Membership for Problems with Exact Rational Solutions: A General Approach via Convex OptimizationAris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, Alexandros Hollender. 1204-1215 [doi]
• From External to Swap Regret 2.0: An Efficient Reduction for Large Action SpacesYuval Dagan, Constantinos Daskalakis, Maxwell Fishelson, Noah Golowich. 1216-1222 [doi]
• Fast Swap Regret Minimization and Applications to Approximate Correlated EquilibriaBinghui Peng, Aviad Rubinstein. 1223-1234 [doi]
• Fair Division via Quantile SharesYakov Babichenko, Michal Feldman, Ron Holzman, Vishnu V. Narayan. 1235-1246 [doi]
• Prophet Inequalities with Cancellation CostsFarbod Ekbatani, Rad Niazadeh, Pranav Nuti, Jan Vondrák. 1247-1258 [doi]
• Explicit Orthogonal Arrays and Universal Hashing with Arbitrary ParametersNicholas Harvey, Arvin Sahami. 1259-1267 [doi]
• Tree Evaluation Is in Space O(log n · log log n)James Cook, Ian Mertz. 1268-1278 [doi]
• Locality Bounds for Sampling Hamming SlicesDaniel M. Kane, Anthony Ostuni, Kewen Wu 0001. 1279-1286 [doi]
• No Complete Problem for Constant-Cost Randomized CommunicationYuting Fang, Lianna Hambardzumyan, Nathaniel Harms, Pooya Hatami. 1287-1298 [doi]
• Explicit Separations between Randomized and Deterministic Number-on-Forehead CommunicationZander Kelley, Shachar Lovett, Raghu Meka. 1299-1310 [doi]
• An Area Law for the Maximally-Mixed Ground State in Arbitrarily Degenerate Systems with Good AGSPItai Arad, Raz Firanko, Rahul Jain. 1311-1322 [doi]
• Local Minima in Quantum SystemsChi-Fang Chen, Hsin-Yuan Huang, John Preskill, Leo Zhou. 1323-1330 [doi]
• An Optimal Tradeoff between Entanglement and Copy Complexity for State TomographySitan Chen, Jerry Li 0001, Allen Liu. 1331-1342 [doi]
• Learning Shallow Quantum CircuitsHsin-Yuan Huang, Yunchao Liu, Michael Broughton, Isaac Kim, Anurag Anshu, Zeph Landau, Jarrod R. McClean. 1343-1351 [doi]
• Improved Stabilizer Estimation via Bell Difference SamplingSabee Grewal, Vishnu Iyer, William Kretschmer, Daniel Liang. 1352-1363 [doi]
• Computing a Fixed Point of Contraction Maps in Polynomial QueriesXi Chen, Yuhao Li 0002, Mihalis Yannakakis. 1364-1373 [doi]
• Self-Improvement for Circuit-Analysis ProblemsR. Ryan Williams. 1374-1385 [doi]
• Formula Size-Depth Tradeoffs for Iterated Sub-permutation Matrix MultiplicationBenjamin Rossman. 1386-1395 [doi]
• Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and BarriersTuomas Hakoniemi, Nutan Limaye, Iddo Tzameret. 1396-1404 [doi]
• Black-Box PPP Is Not Turing-ClosedNoah Fleming, Stefan Grosser, Toniann Pitassi, Robert Robere. 1405-1414 [doi]
• Product Mixing in Compact Lie GroupsDavid Ellis, Guy Kindler, Noam Lifshitz, Dor Minzer. 1415-1422 [doi]
• On Approximability of Satisfiable k-CSPs: IVAmey Bhangale, Subhash Khot, Dor Minzer. 1423-1434 [doi]
• Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration ProblemsShuichi Hirahara, Naoto Ohsaka. 1435-1445 [doi]
• Cosystolic Expansion of Sheaves on Posets with Applications to Good 2-Query Locally Testable Codes and Lifted CodesUriya A. First, Tali Kaufman. 1446-1457 [doi]
• Randomly Punctured Reed-Solomon Codes Achieve List-Decoding Capacity over Linear-Sized FieldsOmar Alrabiah, Venkatesan Guruswami, Ray Li. 1458-1469 [doi]
• Learning Quantum Hamiltonians at Any Temperature in Polynomial TimeAinesh Bakshi, Allen Liu, Ankur Moitra, Ewin Tang. 1470-1477 [doi]
• An Efficient Quantum Parallel Repetition Theorem and ApplicationsJohn Bostanci, Luowen Qian, Nicholas Spooner, Henry Yuen. 1478-1487 [doi]
• The Power of Adaptivity in Quantum Query AlgorithmsUma Girish, Makrand Sinha, Avishay Tal, Kewen Wu 0001. 1488-1497 [doi]
• On the Pauli Spectrum of QAC0Shivam Nadimpalli, Natalie Parham, Francisca Vasconcelos, Henry Yuen. 1498-1506 [doi]
• Approaching the Quantum Singleton Bound with Approximate Error CorrectionThiago Bergamaschi, Louis Golowich, Sam Gunn. 1507-1516 [doi]
• Counting Small Induced Subgraphs with Edge-Monotone PropertiesSimon Döring, Dániel Marx, Philip Wellnitz. 1517-1525 [doi]
• Near-Optimal Streaming Ellipsoidal Rounding for General Convex PolytopesYury Makarychev, Naren Sarayu Manoj, Max Ovsiankin. 1526-1537 [doi]
• Almost-Linear Time Parameterized Algorithm for Rankwidth via Dynamic RankwidthTuukka Korhonen, Marek Sokolowski 0001. 1538-1549 [doi]
• Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph ClassesJan Dreier, Nikolas Mählmann, Szymon Torunczyk. 1550-1560 [doi]
• A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or ColumnDaniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, László A. Végh. 1561-1572 [doi]
• Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and MoreCe Jin 0001, Yinzhan Xu. 1573-1584 [doi]
• Relaxed Local Correctability from Local TestingVinayak M. Kumar, Geoffrey Mon. 1585-1593 [doi]
• On Optimal Coreset Construction for Euclidean (k, z)-ClusteringLingxiao Huang, Jian Li 0015, Xuan Wu 0002. 1594-1604 [doi]
• Understanding the Cluster Linear Program for Correlation ClusteringNairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li 0001, Alantha Newman, Lukas Vogl. 1605-1616 [doi]
• Combinatorial Correlation ClusteringVincent Cohen-Addad, David Rasmussen Lolck, Marcin Pilipczuk, Mikkel Thorup, Shuyi Yan, Hanwen Zhang. 1617-1628 [doi]
• Random-Order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex ArrivalsCalum MacRury, Will Ma. 1629-1640 [doi]
• Prize-Collecting Steiner Tree: A 1.79 ApproximationAli Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi. 1641-1652 [doi]
• Reconfiguration of Basis Pairs in Regular MatroidsKristóf Bérczi, Bence Mátravölgyi, Tamás Schwarcz. 1653-1664 [doi]
• Sparsifying Generalized Linear ModelsArun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford. 1665-1675 [doi]
• Sampling Balanced Forests of Grids in Polynomial TimeSarah Cannon, Wesley Pegden, Jamie Tucker-Foltz. 1676-1687 [doi]
• Sampling Proper Colorings on Line Graphs Using (1+o(1))Δ ColorsYulin Wang, Chihao Zhang 0001, Zihan Zhang. 1688-1699 [doi]
• Hypergraph Unreliability in Quasi-Polynomial TimeRuoxu Cen, Jason Li 0006, Debmalya Panigrahi. 1700-1711 [doi]
• Memory Checking Requires Logarithmic OverheadElette Boyle, Ilan Komargodski, Neekon Vafa. 1712-1723 [doi]
• Perfect Zero-Knowledge PCPs for #PTom Gur, Jack O'Connor, Nicholas Spooner. 1724-1730 [doi]
• One-Way Functions and Zero KnowledgeShuichi Hirahara, Mikito Nanashima. 1731-1738 [doi]
• Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman ProblemAkshima, Tyler Besselman, Siyao Guo, Zhiye Xie, Yuping Ye. 1739-1749 [doi]
• SNARGs under LWE via Propositional ProofsZhengzhong Jin, Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan. 1750-1757 [doi]
• On the Communication Complexity of Approximate Pattern MatchingTomasz Kociumaka, Jakob Nogler, Philip Wellnitz. 1758-1768 [doi]
• Local Borsuk-Ulam, Stability, and ReplicabilityZachary Chase 0001, Bogdan Chornomaz, Shay Moran, Amir Yehudayoff. 1769-1780 [doi]
• A New Information Complexity Measure for Multi-pass Streaming with ApplicationsMark Braverman, Sumegha Garg, Qian Li, Shuo Wang, David P. Woodruff, Jiapeng Zhang. 1781-1792 [doi]
• New Graph and Hypergraph Container Lemmas with Applications in Property TestingEric Blais, Cameron Seth. 1793-1804 [doi]
• Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming ModelJohn Kallaugher, Ojas Parekh, Nadezhda Voronova. 1805-1815 [doi]
• Proof of the Density Threshold Conjecture for Pinwheel SchedulingAkitoshi Kawamura. 1816-1819 [doi]
• Constrained Submodular Maximization via New Bounds for DR-Submodular FunctionsNiv Buchbinder, Moran Feldman. 1820-1831 [doi]
• Optimal Online Discrepancy MinimizationJanardhan Kulkarni, Victor Reis, Thomas Rothvoss. 1832-1840 [doi]
• Supermodular Approximation of Norms and ApplicationsThomas Kesselheim, Marco Molinaro 0001, Sahil Singla 0001. 1841-1852 [doi]
• Ghost Value Augmentation for k-Edge-ConnectivityD. Ellis Hershkowitz, Nathan Klein, Rico Zenklusen. 1853-1864 [doi]
• Breaking the VLB Barrier for Oblivious Reconfigurable NetworksTegan Wilson, Daniel Amir, Nitika Saran, Robert Kleinberg, Vishal Shrivastav, Hakim Weatherspoon. 1865-1876 [doi]
• Lenzen's Distributed Routing Generalized: A Full Characterization of Constant-Time RoutabilityMohsen Ghaffari 0001, Brandon Wang. 1877-1888 [doi]
• Work-Efficient Parallel Derandomization II: Optimal Concentrations via BootstrappingMohsen Ghaffari 0001, Christoph Grunau. 1889-1900 [doi]
• No Distributed Quantum Advantage for Approximate Graph ColoringXavier Coiteux-Roy, Francesco D'Amore 0001, Rishikesh Gajjala, Fabian Kuhn, François Le Gall, Henrik Lievonen, Augusto Modanese, Marc-Olivier Renou, Gustav Schmid, Jukka Suomela. 1901-1910 [doi]
• Optimal Communication Bounds for Classic Functions in the Coordinator Model and BeyondHossein Esfandiari, Praneeth Kacham, Vahab Mirrokni, David P. Woodruff, Peilin Zhong. 1911-1922 [doi]
• Sum-of-Squares Lower Bounds for Independent Set on Ultra-Sparse Random GraphsPravesh K. Kothari, Aaron Potechin, Jeff Xu. 1923-1934 [doi]
• Semidefinite Programming and Linear Equations vs. Homomorphism ProblemsLorenzo Ciardo, Stanislav Zivný. 1935-1943 [doi]
• How Random CSPs Fool HierarchiesSiu On Chan, Hiu Tsun Ng, Sijin Peng. 1944-1955 [doi]
• Swap Cosystolic ExpansionYotam Dikstein, Irit Dinur. 1956-1966 [doi]
• Agreement Theorems for High Dimensional Expanders in the Low Acceptance Regime: The Role of CoversYotam Dikstein, Irit Dinur. 1967-1977 [doi]
• Characterizing Direct Product Testing via Coboundary ExpansionMitali Bafna, Dor Minzer. 1978-1989 [doi]
• Symmetric Exponential Time Requires Near-Maximum Circuit SizeLijie Chen 0001, Shuichi Hirahara, Hanlin Ren. 1990-1999 [doi]
• Symmetric Exponential Time Requires Near-Maximum Circuit Size: Simplified, Truly UniformZeyong Li. 2000-2007 [doi]
• Random (log n)-CNF Are Hard for Cutting Planes (Again)Dmitry Sokolov 0001. 2008-2015 [doi]
• Hardness Condensation by RestrictionMika Göös, Ilan Newman, Artur Riazanov, Dmitry Sokolov 0001. 2016-2027 [doi]
• Explicit Codes for Poly-Size Circuits and Functions That Are Hard to Sample on Low Entropy DistributionsRonen Shaltiel, Jad Silbak. 2028-2038 [doi]
• Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPLDean Doron, Edward Pyne, Roei Tell. 2039-2049 [doi]