Get started
Author

Swastik Kopparty

Split TCP for mobile ad hoc networks
2003 · S. Kopparty, S.V. Krishnamurthy, et al. · IEEE Global Telecommunications Conference (GLOBECOM) · 169
High-rate codes with sublinear-time decoding
2011 · Swastik Kopparty, Shubhangi Saraf, et al. · ACM Symposium on Theory of Computing (STOC) · 134
PDF
New affine-invariant codes from lifting
2013 · Alan Guo, Swastik Kopparty, et al. · Conference on Innovations in Theoretical Computer Science · 89
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
2009 · Zeev Dvir, Swastik Kopparty, et al. · Annual Symposium on Foundations of Computer Science · 85
Optimal Testing of Reed-Muller Codes
2010 · Arnab Bhattacharyya, Swastik Kopparty, et al. · Annual Symposium on Foundations of Computer Science · 80
A framework for pursuit evasion games in
2005 · Swastik Kopparty, Chinya V. Ravishankar · Information Processing Letters · 76
Untitled
2015 · Swastik Kopparty · Theory of Computing · 74
PDF
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
2013 · Zeev Dvir, Swastik Kopparty, et al. · SIAM Journal on Computing · 65
On Proximity Gaps of Reed-Solomon Codes
2020 · Eli Ben-Sasson, Dan Carmon, et al. · Annual Symposium on Foundations of Computer Science · 58
PDF
High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity
2017 · Swastik Kopparty, Or Meir, et al. · Journal of the ACM · 55
PDF
Affine Dispersers from Subspace Polynomials
2009 · Eli Ben-Sasson, Swastik Kopparty · SIAM Journal on Computing · 53
Maximally Recoverable Codes for Grid-like Topologies
2017 · Parikshit Gopalan, Guangda Hu, et al. · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 51
PDF
Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes
2010 · E. Ben-Sasson, S. Kopparty, et al. · IEEE Transactions on Information Theory · 50
Explicit subspace designs
2014 · Venkatesan Guruswami, Swastik Kopparty · COMBINATORICA · 47
On the List-Decodability of Random Linear Codes
2011 · Venkatesan Guruswami, Johan Hastad, et al. · IEEE Transactions on Information Theory · 46
PDF
How to Construct a Correct and Scalable iBGP Configuration
2006 · M. Vutukuru, P. Valiant, et al. · 44
Roads, codes, and spatiotemporal queries
2004 · Sandeep Gupta, Swastik Kopparty, et al. · ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS) · 36
Local List-Decoding and Testing of Random Linear Codes from High Error
2010 · Swastik Kopparty, Shubhangi Saraf · SIAM Journal on Computing · 32
Tolerant Linearity Testing and Locally Testable Codes
2009 · Swastik Kopparty, Shubhangi Saraf · Lecture notes in computer science · 32
Improved Decoding of Folded Reed-Solomon and Multiplicity Codes
2018 · Swastik Kopparty, Noga Ron-Zewi, et al. · Annual Symposium on Foundations of Computer Science · 31
PDF
The homomorphism domination exponent
2011 · Swastik Kopparty, Benjamin Rossman · European Journal of Combinatorics · 30
PDF
DEEP-FRI: Sampling Outside the Box Improves Soundness
2019 · Ben-Sasson, Eli, Goldberg, Lior, et al. · arXiv (Cornell University) · 25
PDF
On the list-decodability of random linear codes
2010 · Venkatesan Guruswami, Johan Hastad, et al. · ACM Symposium on Theory of Computing (STOC) · 23
The minimum rank problem: A counterexample
2007 · Swastik Kopparty, K.P.S. Bhaskara Rao · Linear Algebra and its Applications · 23
PDF
High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity
2016 · Swastik Kopparty, Or Meir, et al. · ACM Symposium on Theory of Computing (STOC) · 22
Works count: 124
Citation count: 1,958
H-index: 23
I10-index: 51
Year
Topic
Type