| 2021 | List-Decodable Subspace Recovery: Dimension Independent Error in Polynomial Time. | Ainesh Bakshi, Pravesh K. Kothari |
| 2021 | The Min-Cost Matching with Concave Delays Problem. | Yossi Azar, Runtian Ren, Danny Vainstein |
| 2021 | Infinite-Duration All-Pay Bidding Games. | Guy Avni, Ismal Jecker, Dorde Zikelic |
| 2021 | Optimal Inapproximability with Universal Factor Graphs. | Per Austrin, Jonah Brown-Cohen, Johan Hstad |
| 2021 | Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier. | Sepehr Assadi, Thomas Kesselheim, Sahil Singla |
| 2021 | Sorting Short Keys in Circuits of Size | Gilad Asharov, Wei-Kai Lin, Elaine Shi |
| 2021 | Constrained-Order Prophet Inequalities. | Makis Arsenis, Odysseas Drosis, Robert Kleinberg |
| 2021 | Analytic quantum weak coin flipping protocols with arbitrarily small bias. | Atul Singh Arora, Jrmie Roland, Chrysoula Vlachou |
| 2021 | 2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees. | Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani |
| 2021 | Approximate Nearest Neighbors Beyond Space Partitions. | Alexandr Andoni, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten |
| 2021 | A Refined Laser Method and Faster Matrix Multiplication. | Josh Alman, Virginia Vassilevska Williams |
| 2021 | Tight Bounds for Parallel Paging and Green Paging. | Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato |
| 2021 | Dimension-Preserving Reductions Between SVP and CVP in Different | Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Zeyong Li, Noah Stephens-Davidowitz |
| 2021 | Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else). | Divesh Aggarwal, Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz |
| 2021 | Decomposing the Complement of the Union of Cubes in Three Dimensions. | Pankaj K. Agarwal, Micha Sharir, Alex Steiger |
| 2021 | On Two-Handed Planar Assembly Partitioning with Connectivity Constraints. | Pankaj K. Agarwal, Boris Aronov, Tzvika Geft, Dan Halperin |
| 2021 | A Lower Bound for Dynamic Fractional Cascading. | Peyman Afshani |
| 2021 | On Testability of First-Order Properties in Bounded-Degree Graphs. | Isolde Adler, Noleen Khler, Pan Peng |
| 2021 | Induced subgraphs of bounded treewidth and the container method. | Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour |
| 2021 | Fast Convergence of Fictitious Play for Diagonal Payoff Matrices. | Jacob D. Abernethy, Kevin A. Lai, Andre Wibisono |
| 2021 | Strongly refuting all semi-random Boolean CSPs. | Jackson Abascal, Venkatesan Guruswami, Pravesh K. Kothari |
| 2020 | Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems. | Sepehr Abbasi Zadeh, Nikhil Bansal, Guru Guruganesh, Aleksandar Nikolov, Roy Schwartz, Mohit Singh |
| 2020 | Fast Fourier Sparsity Testing. | Grigory Yaroslavtsev, Samson Zhou |
| 2020 | A Strongly Polynomial Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs. | Yutaro Yamaguchi |
| 2020 | On the Tractability of Public Persuasion with No Externalities. | Haifeng Xu |