| 2025 | More Asymmetry Yields Faster Matrix Multiplication. | Josh Alman, Ran Duan, Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou |
| 2025 | Sublinear-Round Broadcast without Trusted Setup. | Andreea B. Alexandru, Julian Loss, Charalampos Papamanthou, Giorgos Tsimos, Benedikt Wagner |
| 2025 | Facet-Hamiltonicity. | Hugo A. Akitaya, Jean Cardinal, Stefan Felsner, Linda Kleist, Robert Lauff |
| 2025 | On the Uniqueness of Bayesian Coarse Correlated Equilibria in Standard First-Price and All-Pay Auctions. | Mete Seref Ahunbay, Martin Bichler |
| 2025 | A coarse Erdős-Psa theorem. | Jungho Ahn, Jochen Pascal Gollin, Tony Huynh, O-joung Kwon |
| 2025 | Efficient Approximation Algorithm for Computing Wasserstein Barycenter under Euclidean Metric. | Pankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Keegan Yao |
| 2025 | Private Mean Estimation with Person-Level Differential Privacy. | Sushant Agarwal, Gautam Kamath, Mahbod Majid, Argyris Mouzakis, Rose Silver, Jonathan R. Ullman |
| 2025 | A Cell Probe Lower Bound for the Predecessor Search Problem in PRAM. | Peyman Afshani, Nodari Sitchinava |
| 2025 | Partitioning a Polygon Into Small Pieces. | Mikkel Abrahamsen, Nichlas Langhoff Rasmussen |
| 2025 | Differentiable Approximations for Distance Queries. | Ahmed Abdelkader, David M. Mount |
| 2025 | Recognizing Sumsets is NP-Complete. | Amir Abboud, Nick Fischer, Ron Safier, Nathan Wallheimer |
| 2025 | Path and Intersections: Characterization of Quasi-metrics in Directed Okamura-Seymour Instances. | Yu Chen, Zihan Tan |
| 2025 | Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed Bandits. | Yuchen He, Zichun Ye, Chihao Zhang |
| 2025 | Congestion-Approximators from the Bottom Up. | Jason Li, Satish Rao, Di Wang |
| 2025 | Entropy Regularization and Faster Decremental Matching in General Graphs. | Jiale Chen, Aaron Sidford, Ta-Wei Tu |
| 2025 | On the Locality of Hall's Theorem. | Sebastian Brandt, Yannic Maus, Ananth Narayanan, Florian Schager, Jara Uitto |
| 2025 | Deterministic Edge Connectivity and Max Flow using Subquadratic Cut Queries. | Aditya Anand, Thatchaphol Saranurak, Yunfan Wang |
| 2025 | Top- | Gonzalo Navarro, Yakov Nekrich |
| 2025 | Balancing Notions of Equity: Trade-offs Between Fair Portfolio Sizes and Achievable Guarantees. | Swati Gupta, Jai Moondra, Mohit Singh |
| 2025 | Min-CSPs on Complete Instances. | Aditya Anand, Euiwoong Lee, Amatya Sharma |
| 2025 | The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints. | Sven Jger, Alexander Lindermayr, Nicole Megow |
| 2025 | Unbreakable Decomposition in Close-to-Linear Time. | Aditya Anand, Euiwoong Lee, Jason Li, Yaowei Long, Thatchaphol Saranurak |
| 2025 | Beyond 2-Approximation for | Ce Jin, Yael Kirkpatrick, Virginia Vassilevska Williams, Nicole Wein |
| 2025 | Maximum Span Hypothesis: A Potentially Weaker Assumption than Gap-ETH for Parameterized Complexity. | Karthik C. S., Subhash Khot |
| 2025 | Breaking the Two Approximation Barrier for Various Consensus Clustering Problems. | Debarati Das, Amit Kumar |