| 2021 | Bipartite perfect matching as a real polynomial. | Gal Beniamini, Noam Nisan |
| 2021 | Learnability can be independent of set theory (invited paper). | Shai Ben-David, Pavel Hrubes, Shay Moran, Amir Shpilka, Amir Yehudayoff |
| 2021 | Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces. | Yair Bartal, Lee-Ad Gottlieb |
| 2021 | k-forrelation optimally separates Quantum and classical query complexity. | Nikhil Bansal, Makrand Sinha |
| 2021 | How much data is sufficient to learn high-performing algorithms? generalization guarantees for data-driven algorithm design. | Maria-Florina Balcan, Dan F. DeBlasio, Travis Dick, Carl Kingsford, Tuomas Sandholm, Ellen Vitercik |
| 2021 | Robust linear regression: optimal rates in polynomial time. | Ainesh Bakshi, Adarsh Prasad |
| 2021 | Playing unique games on certified small-set expanders. | Mitali Bafna, Boaz Barak, Pravesh K. Kothari, Tselil Schramm, David Steurer |
| 2021 | Improved Quantum data analysis. | Costin Badescu, Ryan O'Donnell |
| 2021 | Settling the complexity of Nash equilibrium in congestion games. | Yakov Babichenko, Aviad Rubinstein |
| 2021 | Flow time scheduling with uncertain processing time. | Yossi Azar, Stefano Leonardi, Noam Touitou |
| 2021 | Graph streaming lower bounds for parameter estimation and property testing via a streaming XOR lemma. | Sepehr Assadi, Vishvajeet N |
| 2021 | Chasing convex bodies with linear competitive ratio (invited paper). | C. J. Argue, Anupam Gupta, Guru Guruganesh, Ziye Tang |
| 2021 | When is approximate counting for conjunctive queries tractable? | Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram, Cristian Riveros |
| 2021 | A polynomial-time approximation algorithm for counting words accepted by an NFA (invited paper). | Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram, Cristian Riveros |
| 2021 | Log-concave polynomials in theory and applications (tutorial). | Nima Anari, Cynthia Vinzant |
| 2021 | Log-concave polynomials IV: approximate exchange, tight mixing times, and near-optimal sampling of forests. | Nima Anari, Kuikui Liu, Shayan Oveis Gharan, Cynthia Vinzant, Thuy-Duong Vuong |
| 2021 | Discrepancy minimization via a self-balancing walk. | Ryan Alweiss, Yang P. Liu, Mehtaab Sawhney |
| 2021 | Boosting simple learners. | Noga Alon, Alon Gonen, Elad Hazan, Shay Moran |
| 2021 | Adversarial laws of large numbers and optimal regret in online classification. | Noga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran, Moni Naor, Eylon Yogev |
| 2021 | Kronecker products, low-depth circuits, and matrix rigidity. | Josh Alman |
| 2021 | Fractionally log-concave and sector-stable polynomials: counting planar matchings and more. | Yeganeh Alimohammadi, Nima Anari, Kirankumar Shiragur, Thuy-Duong Vuong |
| 2021 | Computational thinking in programming language and compiler design (keynote). | Alfred V. Aho |
| 2021 | Subcubic algorithms for Gomory-Hu tree in unweighted graphs. | Amir Abboud, Robert Krauthgamer, Ohad Trabelsi |
| 2021 | Degree vs. approximate degree and Quantum implications of Huang's sensitivity theorem. | Scott Aaronson, Shalev Ben-David, Robin Kothari, Shravas Rao, Avishay Tal |
| 2021 | Statistical query complexity of manifold estimation. | Eddie Aamari, Alexander Knop |