| 2026 | COLT | Dimension Reduction via Sum-of-Squares and Improved Clustering Algorithms for Non-Spherical Mixtures. | Prashanti Anderson, Mitali Bafna, Rares-Darius Buhai, Pravesh K. Kothari, David Steurer |
| 2025 | STOC | Rounding Large Independent Sets on Expanders. | Mitali Bafna, Jun-Ting Hsieh, Pravesh K. Kothari |
| 2025 | STOC | Quasi-Linear Size PCPs with Small Soundness from HDX. | Mitali Bafna, Dor Minzer, Nikhil Vyas, Zhiwei Yun |
| 2025 | STOC | Constant Degree Networks for Almost-Everywhere Reliable Transmission. | Mitali Bafna, Dor Minzer |
| 2025 | STOC | Near Optimal Constant Inapproximability under ETH for Fundamental Problems in Parameterized Complexity. | Mitali Bafna, Karthik C. S., Dor Minzer |
| 2024 | FOCS | Constant Degree Direct Product Testers with Small Soundness. | Mitali Bafna, Noam Lifshitz, Dor Minzer |
| 2024 | STOC | Characterizing Direct Product Testing via Coboundary Expansion. | Mitali Bafna, Dor Minzer |
| 2022 | FOCS | Polynomial-Time Power-Sum Decomposition of Polynomials. | Mitali Bafna, Jun-Ting Hsieh, Pravesh K. Kothari, Jeff Xu |
| 2022 | SODA | High Dimensional Expanders: Eigenstripping, Pseudorandomness, and Unique Games. | Mitali Bafna, Max Hopkins, Tali Kaufman, Shachar Lovett |
| 2022 | STOC | Hypercontractivity on high dimensional expanders. | Mitali Bafna, Max Hopkins, Tali Kaufman, Shachar Lovett |
| 2021 | ICALP | Optimal Fine-Grained Hardness of Approximation of Linear Equations. | Mitali Bafna, Nikhil Vyas |
| 2021 | STOC | Playing unique games on certified small-set expanders. | Mitali Bafna, Boaz Barak, Pravesh K. Kothari, Tselil Schramm, David Steurer |
| 2020 | ISNCC | Improving Accuracy of Differentially Private Kronecker Social Networks via Graph Clustering. | Arinjita Paul, Vorapong Suppakitpaisarn, Mitali Bafna, C. Pandu Rangan |
| 2019 | SODA | Communication-Rounds Tradeoffs for Common Randomness and Secret Key Generation. | Madhu Sudan, Badih Ghazi, Noah Golowich, Mitali Bafna |
| 2017 | COLT | The Price of Selection in Differential Privacy. | Mitali Bafna, Jonathan R. Ullman |
| 2016 | MFCS | On the Sensitivity Conjecture for Read-k Formulas. | Mitali Bafna, Satyanarayana V. Lokam, Sbastien Tavenas, Ameya Velingker |