Split TCP for mobile ad hoc networks. - Swastik Kopparty; Srikanth V. Krishnamurthy; Michalis Faloutsos; Satish K. Tripathi (GLOBECOM, 2002)

Roads, Codes and Spatiotemporal Queries. - Sandeep Gupta 004; Swastik Kopparty; Chinya V. Ravishankar (PODS, 2004)

A framework for pursuit evasion games in Rn. - Swastik Kopparty; Chinya V. Ravishankar (Inf. Process. Lett., 2005)

Local Decoding and Testing for Homomorphisms. - Elena Grigorescu; Swastik Kopparty; Madhu Sudan 001 (APPROX-RANDOM, 2006)

Subspace Polynomials and List Decoding of Reed-Solomon Codes. - Eli Ben-Sasson; Swastik Kopparty; Jaikumar Radhakrishnan (FOCS, 2006)

How to Construct a Correct and Scalable iBGP Configuration. - Mythili Vutukuru; Paul Valiant; Swastik Kopparty; Hari Balakrishnan (INFOCOM, 2006)

Detecting Rational Points on Hypersurfaces over Finite Fields. - Swastik Kopparty; Sergey Yekhanin (CCC, 2008)

Decodability of Group Homomorphisms beyond the Johnson Bound. - Irit Dinur; Elena Grigorescu; Swastik Kopparty; Madhu Sudan 001 (Electron. Colloquium Comput. Complex., 2008)

Universal capacity of channels with given rate-distortion in absence of common randomness, and failure of universal source-channel separation. - Mukul Agarwal; Swastik Kopparty; Sanjoy K. Mitter (Allerton, 2009)

Tolerant Linearity Testing and Locally Testable Codes. - Swastik Kopparty; Shubhangi Saraf (APPROX-RANDOM, 2009)

On the Communication Complexity of Read-Once AC^0 Formulae. - T. S. Jayram; Swastik Kopparty; Prasad Raghavendra (CCC, 2009)

Optimal testing of Reed-Muller codes. - Arnab Bhattacharyya 001; Swastik Kopparty; Grant Schoenebeck; Madhu Sudan 001; David Zuckerman (Electron. Colloquium Comput. Complex., 2009)

Random Graphs and the Parity Quantifier. - Phokion G. Kolaitis; Swastik Kopparty (Electron. Colloquium Comput. Complex., 2009)

Optimal Testing of Reed-Muller Codes. - Arnab Bhattacharyya 001; Swastik Kopparty; Grant Schoenebeck; Madhu Sudan 001; David Zuckerman (Property Testing, 2010)

Some Recent Results on Local Testing of Sparse Linear Codes. - Swastik Kopparty; Shubhangi Saraf (Property Testing, 2010)

On the List-Decodability of Random Linear Codes. - Venkatesan Guruswami; Johan Håstad; Swastik Kopparty (Electron. Colloquium Comput. Complex., 2010)

High-rate codes with sublinear-time decoding. - Swastik Kopparty; Shubhangi Saraf; Sergey Yekhanin (Electron. Colloquium Comput. Complex., 2010)

Subspace polynomials and limits to list decoding of Reed-Solomon codes. - Eli Ben-Sasson; Swastik Kopparty; Jaikumar Radhakrishnan (IEEE Trans. Inf. Theory, 2010)

Algebraic methods in randomness and pseudorandomness. - Swastik Kopparty (2010)

On the complexity of powering in finite fields. - Swastik Kopparty (STOC, 2011)

The homomorphism domination exponent. - Swastik Kopparty; Benjamin Rossman (Eur. J. Comb., 2011)

Review of algebraic function fields and codes by Henning Stichtenoth. - Swastik Kopparty (SIGACT News, 2011)

Certifying polynomials for AC^0(parity) circuits, with applications. - Swastik Kopparty; Srikanth Srinivasan 001 (FSTTCS, 2012)

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 (Electron. Colloquium Comput. Complex., 2012)

New affine-invariant codes from lifting. - Alan Guo; Swastik Kopparty; Madhu Sudan 001 (Electron. Colloquium Comput. Complex., 2012)

List-Decoding Multiplicity Codes. - Swastik Kopparty (Electron. Colloquium Comput. Complex., 2012)

Certifying Polynomials for AC0[⊕] circuits, with applications. - Swastik Kopparty; Srikanth Srinivasan 001 (Electron. Colloquium Comput. Complex., 2012)

Affine Dispersers from Subspace Polynomials. - Eli Ben-Sasson; Swastik Kopparty (SIAM J. Comput., 2012)

Some remarks on multiplicity codes. - Swastik Kopparty (Discrete Geometry and Algebraic Combinatorics, 2013)

Constant rate PCPs for circuit-SAT with sublinear query complexity. - Eli Ben-Sasson; Yohay Kaplan; Swastik Kopparty; Or Meir; Henning Stichtenoth (Electron. Colloquium Comput. Complex., 2013)

Explicit Subspace Designs. - Venkatesan Guruswami; Swastik Kopparty (Electron. Colloquium Comput. Complex., 2013)

Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers. - Zeev Dvir; Swastik Kopparty; Shubhangi Saraf; Madhu Sudan 001 (SIAM J. Comput., 2013)

Local List-Decoding and Testing of Random Linear Codes from High Error. - Swastik Kopparty; Shubhangi Saraf (SIAM J. Comput., 2013)

Simultaneous Approximation of Constraint Satisfaction Problems. - Amey Bhangale; Swastik Kopparty; Sushant Sachdeva (Electron. Colloquium Comput. Complex., 2014)

Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization. - Swastik Kopparty; Shubhangi Saraf; Amir Shpilka (Electron. Colloquium Comput. Complex., 2014)

Roots and coefficients of polynomials over finite fields. - Swastik Kopparty; Qiang Wang 012 (Finite Fields Their Appl., 2014)

Equivalence of Polynomial Identity Testing and Polynomial Factorization. - Swastik Kopparty; Shubhangi Saraf; Amir Shpilka (Comput. Complex., 2015)

The complexity of computing the minimum rank of a sign pattern matrix. - Amey Bhangale; Swastik Kopparty (CoRR, 2015)

Efficient indexing of necklaces and irreducible polynomials over finite fields. - Swastik Kopparty; Mrinal Kumar 001; Michael E. Saks (Electron. Colloquium Comput. Complex., 2015)

High-rate Locally-testable Codes with Quasi-polylogarithmic Query Complexity. - Swastik Kopparty; Or Meir; Noga Ron-Zewi; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2015)

High rate locally-correctable and locally-testable codes with sub-polynomial query complexity. - Swastik Kopparty; Noga Ron-Zewi; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2015)

Robust positioning patterns. - Ross Berkowitz; Swastik Kopparty (SODA, 2016)

Locally testable and Locally correctable Codes Approaching the Gilbert-Varshamov Bound. - Sivakanth Gopi; Swastik Kopparty; Rafael Mendes de Oliveira; Noga Ron-Zewi; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2016)

A local central limit theorem for triangles in a random graph. - Justin Gilmer; Swastik Kopparty (Random Struct. Algorithms, 2016)

Guest Column: Local Testing and Decoding of High-Rate Error-Correcting Codes. - Swastik Kopparty; Shubhangi Saraf (SIGACT News, 2016)

List-Decoding Algorithms for Lifted Codes. - Alan Guo; Swastik Kopparty (IEEE Trans. Inf. Theory, 2016)

Maximally Recoverable Codes for Grid-like Topologies. - Parikshit Gopalan; Guangda Hu; Swastik Kopparty; Shubhangi Saraf; Carol Wang; Sergey Yekhanin (SODA, 2017)

Local Testing and Decoding of High-Rate Error-Correcting Codes. - Swastik Kopparty; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2017)

High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity. - Swastik Kopparty; Or Meir; Noga Ron-Zewi; Shubhangi Saraf (J. ACM, 2017)

Decoding Reed-Muller Codes over Product Sets. - John Y. Kim; Swastik Kopparty (Theory Comput., 2017)

Near-optimal approximation algorithm for simultaneous Max-Cut. - Amey Bhangale; Subhash Khot; Swastik Kopparty; Sushant Sachdeva; Devanathan Thiruvenkatachari (SODA, 2018)

Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields. - Swastik Kopparty; Aditya Potukuchi (SODA, 2018)

A Cauchy-Davenport Theorem for Linear Maps. - Simao Herdade; John Kim; Swastik Kopparty (Comb., 2018)

Worst-case to average case reductions for the distance to a code. - Eli Ben-Sasson; Swastik Kopparty; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2018)

On Multilinear Forms: Bias, Correlation, and Tensor Rank. - Abhishek Bhrushundi; Prahladh Harsha; Pooya Hatami; Swastik Kopparty; Mrinal Kumar 001 (Electron. Colloquium Comput. Complex., 2018)

Improved decoding of Folded Reed-Solomon and Multiplicity Codes. - Swastik Kopparty; Noga Ron-Zewi; Shubhangi Saraf; Mary Wootters (Electron. Colloquium Comput. Complex., 2018)

Certifying Polynomials for $ mathrm{AC}^0[ oplus]$ Circuits, with Applications to Lower Bounds and Circuit Compression. - Swastik Kopparty; Srikanth Srinivasan 001 (Theory Comput., 2018)

DEEP-FRI: Sampling Outside the Box Improves Soundness. - Eli Ben-Sasson; Lior Goldberg; Swastik Kopparty; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2019)

On List Recovery of High-Rate Tensor Codes. - Swastik Kopparty; Nicolas Resch; Noga Ron-Zewi; Shubhangi Saraf; Shashwat Silas (Electron. Colloquium Comput. Complex., 2019)

Quasilinear time list-decodable codes for space bounded channels. - Ronen Shaltiel; Swastik Kopparty; Jad Silbak (Electron. Colloquium Comput. Complex., 2019)

Special Section on the Fifty-Seventh Annual IEEE Symposium on Foundations of Computer Science (FOCS 2016). - Irit Dinur; Or Meir; Swastik Kopparty (SIAM J. Comput., 2019)

Proximity Gaps for Reed-Solomon Codes. - Eli Ben-Sasson; Dan Carmon; Yuval Ishai; Swastik Kopparty; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2020)

Geometric Rank of Tensors and Subrank of Matrix Multiplication. - Swastik Kopparty; Guy Moshkovitz; Jeroen Zuiddam (Electron. Colloquium Comput. Complex., 2020)

Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields. - Eli Ben-Sasson; Dan Carmon; Swastik Kopparty; David Levit (Electron. Colloquium Comput. Complex., 2021)

Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves. - Eli Ben-Sasson; Dan Carmon; Swastik Kopparty; David Levit (Electron. Colloquium Comput. Complex., 2022)

Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves (ECFFT part II). - Eli Ben-Sasson; Dan Carmon; Swastik Kopparty; David Levit (IACR Cryptol. ePrint Arch., 2022)

Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Low-degree Extension in Time O(n log n) over all Finite Fields. - Eli Ben-Sasson; Dan Carmon; Swastik Kopparty; David Levit (SODA, 2023)

On the degree of polynomials computing square roots mod p. - Kiran S. Kedlaya; Swastik Kopparty (Electron. Colloquium Comput. Complex., 2023)

Extracting Mergers and Projections of Partitions. - Swastik Kopparty; Vishvajeet N (Electron. Colloquium Comput. Complex., 2023)

Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes. - Swastik Kopparty; Noga Ron-Zewi; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2023)

Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes. - Swastik Kopparty; Noga Ron-Zewi; Shubhangi Saraf; Mary Wootters (SIAM J. Comput., 2023)

Improved PIR Schemes using Matching Vectors and Derivatives. - Fatemeh Ghasemi; Swastik Kopparty; Madhu Sudan 001 (Electron. Colloquium Comput. Complex., 2024)

High Rate Multivariate Polynomial Evaluation Codes. - Swastik Kopparty; Mrinal Kumar 001; Harry Sha (Electron. Colloquium Comput. Complex., 2024)

Small Shadow Partitions. - Swastik Kopparty; Harry Sha (Electron. Colloquium Comput. Complex., 2024)

Character sums over AG codes. - Swastik Kopparty; Amnon Ta-Shma; Kedem Yakirevitch (Electron. Colloquium Comput. Complex., 2024)

Error-Correcting Graph Codes. - Swastik Kopparty; Aditya Potukuchi; Harry Sha (ITCS, 2025)