| 2026 | STOC | On Proximity Gaps of Reed-Solomon Codes. | Eli Ben-Sasson, Dan Carmon, Ulrich Habck, Swastik Kopparty, Shubhangi Saraf |
| 2025 | STOC | Improved PIR Schemes using Matching Vectors and Derivatives. | Fatemeh Ghasemi, Swastik Kopparty, Madhu Sudan |
| 2025 | STOC | High Rate Multivariate Polynomial Evaluation Codes. | Swastik Kopparty, Mrinal Kumar, Harry Sha |
| 2023 | SODA | Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Low-degree Extension in Time | Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit |
| 2022 | TCC | Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves - (ECFFT Part II). | Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit |
| 2020 | FOCS | Proximity Gaps for Reed-Solomon Codes. | Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf |
| 2019 | FOCS | Quasilinear Time List-Decodable Codes for Space Bounded Channels. | Jad Silbak, Swastik Kopparty, Ronen Shaltiel |
| 2018 | FOCS | Improved Decoding of Folded Reed-Solomon and Multiplicity Codes. | Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters |
| 2018 | SODA | Near-optimal approximation algorithm for simultaneous Max-Cut. | Amey Bhangale, Subhash Khot, Swastik Kopparty, Sushant Sachdeva, Devanathan Thiruvenkatachari |
| 2018 | SODA | Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields. | Swastik Kopparty, Aditya Potukuchi |
| 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 | SODA | Robust positioning patterns. | Ross Berkowitz, Swastik Kopparty |
| 2016 | STOC | High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity. | Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf |
| 2015 | ICALP | Simultaneous Approximation of Constraint Satisfaction Problems. | Amey Bhangale, Swastik Kopparty, Sushant Sachdeva |
| 2014 | ICALP | Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields. | Swastik Kopparty, Mrinal Kumar, Michael E. Saks |
| 2013 | FOCS | Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity. | Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth |
| 2013 | FOCS | Explicit Subspace Designs. | Venkatesan Guruswami, Swastik Kopparty |
| 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 | STOC | On the complexity of powering in finite fields. | Swastik Kopparty |
| 2011 | STOC | High-rate codes with sublinear-time decoding. | Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin |
| 2010 | FOCS | Optimal Testing of Reed-Muller Codes. | Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman |
| 2010 | STOC | On the list-decodability of random linear codes. | Venkatesan Guruswami, Johan Hstad, Swastik Kopparty |
| 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 | STOC | Affine dispersers from subspace polynomials. | Eli Ben-Sasson, Swastik Kopparty |
| 2009 | STOC | Random graphs and the parity quantifier. | Phokion G. Kolaitis, Swastik Kopparty |
| 2008 | STOC | Decodability of group homomorphisms beyond the johnson bound. | Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan |
| 2006 | FOCS | Subspace Polynomials and List Decoding of Reed-Solomon Codes. | Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan |
| 2006 | INFOCOM | How to Construct a Correct and Scalable iBGP Configuration. | Mythili Vutukuru, Paul Valiant, Swastik Kopparty, Hari Balakrishnan |
| 2004 | PODS | Roads, Codes and Spatiotemporal Queries. | Sandeep Gupta, Swastik Kopparty, Chinya V. Ravishankar |
| 2002 | GLOBECOM | Split TCP for mobile ad hoc networks. | Swastik Kopparty, Srikanth V. Krishnamurthy, Michalis Faloutsos, Satish K. Tripathi |