| 2025 | Quantum LDPC Codes with Transversal Non-Clifford Gates via Products of Algebraic Codes. | Louis Golowich, Ting-Chun Lin |
| 2025 | Asymptotically Good Quantum Codes with Transversal Non-Clifford Gates. | Louis Golowich, Venkatesan Guruswami |
| 2025 | Oblivious Defense in ML Models: Backdoor Removal without Detection. | Shafi Goldwasser, Jonathan Shafer, Neekon Vafa, Vinod Vaikuntanathan |
| 2025 | Metric Distortion of Small-Group Deliberation. | Ashish Goel, Mohak Goyal, Kamesh Munagala |
| 2025 | Single-Sample and Robust Online Resource Allocation. | Rohan Ghuge, Sahil Singla, Yifan Wang |
| 2025 | Using the Planted Clique Conjecture for Cryptography: Public-Key Encryption from Planted Clique and Noisy k-LIN over Expanders. | Riddhi Ghosal, Isaac M. Hair, Aayush Jain, Amit Sahai |
| 2025 | Improved PIR Schemes using Matching Vectors and Derivatives. | Fatemeh Ghasemi, Swastik Kopparty, Madhu Sudan |
| 2025 | Constant-Factor EFX Exists for Chores. | Jugal Garg, Aniket Murhekar, John Qin |
| 2025 | Primes via Zeros: Interactive Proofs for Testing Primality of Natural Classes of Ideals. | Abhibhav Garg, Rafael Oliveira, Nitin Saxena |
| 2025 | Bypassing the Noisy Parity Barrier: Learning Higher-Order Markov Random Fields from Dynamics. | Jason Gaitonde, Ankur Moitra, Elchanan Mossel |
| 2025 | Minimum Degree Edge-Disjoint Hamilton Cycles in Random Directed Graphs. | Asaf Ferber, Adva Mond |
| 2025 | Constant Approximation for Weighted Nash Social Welfare with Submodular Valuations. | Yuda Feng, Yang Hu, Shi Li, Ruilong Zhang |
| 2025 | Constant-Cost Communication Is Not Reducible to k-Hamming Distance. | Yuting Fang, Mika Gs, Nathaniel Harms, Pooya Hatami |
| 2025 | Multi-parameter Mechanisms for Consumer Surplus Maximization. | Tomer Ezra, Daniel Schoepflin, Ariel Shaulker |
| 2025 | Optimal Proof Systems for Complex Sets Are Hard to Find. | Fabian Egidy, Christian Glaer |
| 2025 | Approximately Counting and Sampling Hamiltonian Motifs in Sublinear Time. | Talya Eden, Reut Levi, Dana Ron, Ronitt Rubinfeld |
| 2025 | On Approximability of the Permanent of PSD Matrices. | Farzam Ebrahimnejad, Ansh Nagda, Shayan Oveis Gharan |
| 2025 | The Cost of Consistency: Submodular Maximization with Constant Recourse. | Paul Dtting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson, Morteza Zadimoghaddam |
| 2025 | Breaking the Sorting Barrier for Directed Single-Source Shortest Paths. | Ran Duan, Jiayi Mao, Xiao Mao, Xinkai Shu, Longhui Yin |
| 2025 | Merge-Width and First-Order Model Checking. | Jan Dreier, Szymon Torunczyk |
| 2025 | Disjoint Connected Dominating Sets in Pseudorandom Graphs. | Nemanja Draganic, Michael Krivelevich |
| 2025 | When Connectivity Is Hard, Random Walks Are Easy with Non-determinism. | Dean Doron, Edward Pyne, Roei Tell, R. Ryan Williams |
| 2025 | A New Approach for LPN-Based Pseudorandom Functions: Low-Depth and Key-Homomorphic. | Youlong Ding, Aayush Jain, Ilan Komargodski |
| 2025 | Entangled Mean Estimation in High Dimensions. | Ilias Diakonikolas, Daniel M. Kane, Sihan Liu, Thanasis Pittas |
| 2025 | SoS Certificates for Sparse Singular Values and Their Applications: Robust Statistics, Subspace Distortion, and More. | Ilias Diakonikolas, Samuel B. Hopkins, Ankit Pensia, Stefan Tiegel |