| 2022 | Interactive error correcting codes over binary erasure channels resilient to > ½ adversarial corruption. | Meghal Gupta, Yael Tauman Kalai, Rachel Yun Zhang |
| 2022 | Parallel repetition for all 3-player games over binary alphabet. | Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan |
| 2022 | Expanders via local edge flips in quasilinear time. | George Giakkoupis |
| 2022 | Low-temperature Ising dynamics with random initializations. | Reza Gheissari, Alistair Sinclair |
| 2022 | Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture. | Sevag Gharibian, Franois Le Gall |
| 2022 | Fast FPT-approximation of branchwidth. | Fedor V. Fomin, Tuukka Korhonen |
| 2022 | Counting small induced subgraphs with hereditary properties. | Jacob Focke, Marc Roth |
| 2022 | Deterministic (1+ | Manuela Fischer, Slobodan Mitrovic, Jara Uitto |
| 2022 | Locality-sensitive orderings and applications to reliable spanners. | Arnold Filtser, Hung Le |
| 2022 | The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity. | Zhiyuan Fan, Jiatu Li, Tianqi Yang |
| 2022 | Learning low-degree functions from a logarithmic number of random queries. | Alexandros Eskenazis, Paata Ivanisvili |
| 2022 | Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios. | Matthias Englert, Nicolaos Matsakis, Pavel Vesel |
| 2022 | Circuits resilient to short-circuit errors. | Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena |
| 2022 | Maintaining exact distances under multiple edge failures. | Ran Duan, Hanlin Ren |
| 2022 | On the hardness of dominant strategy mechanism design. | Shahar Dobzinski, Shiri Ron, Jan Vondrk |
| 2022 | Locally testable codes with constant rate, distance, and locality. | Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, Shahar Mozes |
| 2022 | Learning general halfspaces with general Massart noise under the Gaussian distribution. | Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis |
| 2022 | Clustering mixture models in almost-linear time via list-decodable mean estimation. | Ilias Diakonikolas, Daniel M. Kane, Daniel Kongsgaard, Jerry Li, Kevin Tian |
| 2022 | Approximately efficient bilateral trade. | Yuan Deng, Jieming Mao, Balasubramanian Sivan, Kangning Wang |
| 2022 | Constant inapproximability for PPA. | Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos |
| 2022 | Fast rates for nonparametric online learning: from realizability to learning in games. | Constantinos Daskalakis, Noah Golowich |
| 2022 | A new framework for matrix discrepancy: partial coloring bounds via mirror descent. | Daniel Dadush, Haotian Jiang, Victor Reis |
| 2022 | Deterministic massively parallel connectivity. | Sam Coy, Artur Czumaj |
| 2022 | Near-optimal Quantum algorithms for multivariate mean estimation. | Arjan Cornelissen, Yassine Hamoudi, Sofine Jerbi |
| 2022 | Deniable encryption in a Quantum world. | Andrea Coladangelo, Shafi Goldwasser, Umesh V. Vazirani |