On the Sensitivity Conjecture for Read-k Formulas. - Mitali Bafna; Satyanarayana V. Lokam; Sébastien Tavenas; Ameya Velingker (Electron. Colloquium Comput. Complex., 2016)

The Price of Selection in Differential Privacy. - Mitali Bafna; Jonathan R. Ullman (COLT, 2017)

Thwarting Adversarial Examples: An L_0-Robust Sparse Fourier Transform. - Mitali Bafna; Jack Murtagh; Nikhil Vyas 001 (NeurIPS, 2018)

Thwarting Adversarial Examples: An L0-RobustSparse Fourier Transform. - Mitali Bafna; Jack Murtagh; Nikhil Vyas 001 (CoRR, 2018)

Communication-Rounds Tradeoffs for Common Randomness and Secret Key Generation. - Mitali Bafna; Badih Ghazi; Noah Golowich; Madhu Sudan 001 (Electron. Colloquium Comput. Complex., 2018)

Imperfect Gaps in Gap-ETH and PCPs. - Mitali Bafna; Nikhil Vyas 001 (CCC, 2019)

Improving Accuracy of Differentially Private Kronecker Social Networks via Graph Clustering. - Arinjita Paul; Vorapong Suppakitpaisarn; Mitali Bafna; C. Pandu Rangan (ISNCC, 2020)

Local decoding and testing of polynomials over grids. - Mitali Bafna; Srikanth Srinivasan 001; Madhu Sudan 001 (Random Struct. Algorithms, 2020)

Optimal Fine-Grained Hardness of Approximation of Linear Equations. - Mitali Bafna; Nikhil Vyas 001 (ICALP, 2021)

Playing unique games on certified small-set expanders. - Mitali Bafna; Boaz Barak; Pravesh K. Kothari; Tselil Schramm; David Steurer (STOC, 2021)

Hypercontractivity on High Dimensional Expanders: a Local-to-Global Approach for Higher Moments. - Mitali Bafna; Max Hopkins; Tali Kaufman; Shachar Lovett (Electron. Colloquium Comput. Complex., 2021)

Polynomial-Time Power-Sum Decomposition of Polynomials. - Mitali Bafna; Jun-Ting Hsieh; Pravesh K. Kothari; Jeff Xu (FOCS, 2022)

High Dimensional Expanders: Eigenstripping, Pseudorandomness, and Unique Games. - Mitali Bafna; Max Hopkins; Tali Kaufman; Shachar Lovett (SODA, 2022)

Hypercontractivity on high dimensional expanders. - Mitali Bafna; Max Hopkins; Tali Kaufman; Shachar Lovett (STOC, 2022)

Characterizing Direct Product Testing via Coboundary Expansion. - Mitali Bafna; Dor Minzer (Electron. Colloquium Comput. Complex., 2023)

Solving Unique Games over Globally Hypercontractive Graphs. - Mitali Bafna; Dor Minzer (CCC, 2024)

Quasi-Linear Size PCPs with Small Soundness from HDX. - Mitali Bafna; Dor Minzer; Nikhil Vyas 001 (CoRR, 2024)

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 (CoRR, 2024)

Constant Degree Direct Product Testers with Small Soundness. - Mitali Bafna; Noam Lifshitz; Dor Minzer (Electron. Colloquium Comput. Complex., 2024)

Rounding Large Independent Sets on Expanders. - Mitali Bafna; Jun-Ting Hsieh; Pravesh K. Kothari (STOC, 2025)

Quasi-Linear Size PCPs with Small Soundness from HDX. - Mitali Bafna; Dor Minzer; Nikhil Vyas 001; Zhiwei Yun (STOC, 2025)

Constant Degree Networks for Almost-Everywhere Reliable Transmission. - Mitali Bafna; Dor Minzer (STOC, 2025)

Near Optimal Constant Inapproximability under ETH for Fundamental Problems in Parameterized Complexity. - Mitali Bafna; Karthik C. S. 001; Dor Minzer (STOC, 2025)