| 2025 | Improved List Size for Folded Reed-Solomon Codes. | Shashank Srivastava |
| 2025 | Hermitian Diagonalization in Linear Precision. | Rikhav Shah |
| 2025 | Quartic quantum speedups for planted inference. | Alexander Schmidhuber, Ryan O'Donnell, Robin Kothari, Ryan Babbush |
| 2025 | Streaming Algorithms via Local Algorithms for Maximum Directed Cut. | Raghuvansh R. Saxena, Noah G. Singer, Madhu Sudan, Santhoshini Velusamy |
| 2025 | Parameterizing the quantification of CMSO: model checking on minor-closed graph classes. | Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2025 | Fine-Grained Optimality of Partially Dynamic Shortest Paths and More. | Barna Saha, Virginia Vassilevska Williams, Yinzhan Xu, Christopher Ye |
| 2025 | An Efficient Regularity Lemma for Semi-Algebraic Hypergraphs. | Natan Rubin |
| 2025 | Polynomial-Time Classical Simulation of Noisy IQP Circuits with Constant Depth. | Joel Rajakumar, James D. Watson, Yi-Kai Liu |
| 2025 | Universal Perfect Samplers for Incremental Streams. | Seth Pettie, Dingyu Wang |
| 2025 | A Refutation of the Pach-Tardos Conjecture for 0-1 Matrices. | Seth Pettie, Gbor Tardos |
| 2025 | A Dichotomy Hierarchy for Linear Time Subgraph Counting in Bounded Degeneracy Graphs. | Daniel Paul-Pena, C. Seshadhri |
| 2025 | Parks and Recreation: Color Fault-Tolerant Spanners Made Local. | Merav Parter, Asaf Petruschka, Shay Sapir, Elad Tzalik |
| 2025 | Complexity of polytope diameters via perfect matchings. | Christian Nbel, Raphael Steiner |
| 2025 | A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints. | Jesper Nederlof, Cline M. F. Swennenhuis, Karol Wegrzycki |
| 2025 | Online Dependent Rounding Schemes for Bipartite Matchings, with. | Joseph (Seffi) Naor, Aravind Srinivasan, David Wajc |
| 2025 | Locally Testable Tree Codes. | Tamer Mour, Alon Rosen, Ron Rothblum |
| 2025 | Putting Off the Catching Up: Online Joint Replenishment Problem with Holding and Backlog Costs. | Benjamin Moseley, Aidin Niaparast, R. Ravi |
| 2025 | Prophet Inequalities: Competing with the Top | Mathieu Molina, Nicolas Gast, Patrick Loiseau, Vianney Perchet |
| 2025 | A topological proof of the Hell-Nešetřil dichotomy. | Sebastian Meyer, Jakub Oprsal |
| 2025 | The Change-of-Measure Method, Block Lewis Weights, and Approximating Matrix Block Norms. | Naren Sarayu Manoj, Max Ovsiankin |
| 2025 | Connectivity Labeling Schemes for Edge and Vertex Faults via Expander Hierarchies. | Yaowei Long, Seth Pettie, Thatchaphol Saranurak |
| 2025 | Parameterized Approximation for Capacitated | Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Vaishali Surianarayanan, Jie Xue |
| 2025 | Crossing Number in Slightly Superexponential Time (Extended Abstract). | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Jie Xue, Meirav Zehavi |
| 2025 | On Estimating the Trace of Quantum State Powers. | Yupan Liu, Qisheng Wang |
| 2025 | Improved Explicit Near-Optimal Codes in the High-Noise Regimes. | Xin Li, Songtao Mao |