| 2026 | STOC | On Proximity Gaps of Reed-Solomon Codes. | Eli Ben-Sasson, Dan Carmon, Ulrich Habck, Swastik Kopparty, Shubhangi Saraf |
| 2026 | STOC | Closure under Factorization from a Result of Furstenberg. | Somnath Bhattacharjee, Mrinal Kumar, Shanthanu S. Rai, Varun Ramanathan, Ramprasad Saptharishi, Shubhangi Saraf |
| 2026 | STOC | Reconstruction of Depth-3 Arithmetic Circuits with Constant Top Fan-In. | Shubhangi Saraf, Devansh Shringi, Narmada Varadarajan |
| 2025 | FOCS | Deterministic factorization of constant-depth algebraic circuits in subexponential time. | Somnath Bhattacharjee, Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi, Shubhangi Saraf |
| 2023 | STOC | Linear Independence, Alternants, and Applications. | Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich |
| 2021 | STOC | Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits. | Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich |
| 2020 | FOCS | Proximity Gaps for Reed-Solomon Codes. | Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf |
| 2020 | SODA | Reconstruction of Depth-4 Multilinear Circuits. | Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich |
| 2018 | FOCS | Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree. | Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich |
| 2018 | FOCS | Improved Decoding of Folded Reed-Solomon and Multiplicity Codes. | Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters |
| 2017 | SODA | Maximally Recoverable Codes for Grid-like Topologies. | Parikshit Gopalan, Guangda Hu, Swastik Kopparty, Shubhangi Saraf, Carol Wang, Sergey Yekhanin |
| 2017 | SODA | Locally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound. | Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf |
| 2016 | STOC | High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity. | Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf |
| 2014 | FOCS | On the Power of Homogeneous Depth 4 Arithmetic Circuits. | Mrinal Kumar, Shubhangi Saraf |
| 2014 | ICALP | Lower Bounds for Approximate LDCs. | Jop Brit, Zeev Dvir, Guangda Hu, Shubhangi Saraf |
| 2014 | ICALP | Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits. | Mrinal Kumar, Shubhangi Saraf |
| 2014 | LATIN | Helly-Type Theorems in Property Testing. | Sourav Chakraborty, Rameshwar Pratap, Sasanka Roy, Shubhangi Saraf |
| 2014 | STOC | Breaking the quadratic barrier for 3-LCC's over the reals. | Zeev Dvir, Shubhangi Saraf, Avi Wigderson |
| 2014 | STOC | The limits of depth reduction for arithmetic formulas: it's all about the top fan-in. | Mrinal Kumar, Shubhangi Saraf |
| 2013 | STOC | A new family of locally correctable codes based on degree-lifted algebraic geometry codes. | Eli Ben-Sasson, Ariel Gabizon, Yohay Kaplan, Swastik Kopparty, Shubhangi Saraf |
| 2011 | FOCS | Tight Lower Bounds for 2-query LCCs over Finite Fields. | Arnab Bhattacharyya, Zeev Dvir, Amir Shpilka, Shubhangi Saraf |
| 2011 | STOC | High-rate codes with sublinear-time decoding. | Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin |
| 2011 | STOC | Black-box identity testing of depth-4 multilinear circuits. | Shubhangi Saraf, Ilya Volkovich |
| 2010 | STOC | Local list-decoding and testing of random linear codes from high error. | Swastik Kopparty, Shubhangi Saraf |
| 2009 | FOCS | Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers. | Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan |
| 2009 | FOCS | Blackbox Polynomial Identity Testing for Depth 3 Circuits. | Neeraj Kayal, Shubhangi Saraf |