Split TCP for mobile ad hoc networks S Kopparty, SV Krishnamurthy, M Faloutsos, SK Tripathi
Global Telecommunications Conference, 2002. GLOBECOM'02. IEEE 1, 138-142, 2002
281 2002 Extensions to the method of multiplicities, with applications to Kakeya sets and mergers Z Dvir, S Kopparty, S Saraf, M Sudan
SIAM Journal on Computing 42 (6), 2305-2328, 2013
211 2013 High-rate codes with sublinear-time decoding S Kopparty, S Saraf, S Yekhanin
Journal of the ACM (JACM) 61 (5), 1-20, 2014
165 2014 Optimal testing of Reed-Muller codes A Bhattacharyya, S Kopparty, G Schoenebeck, M Sudan, D Zuckerman
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 488-497, 2010
110 2010 New affine-invariant codes from lifting A Guo, S Kopparty, M Sudan
Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013
105 2013 High-rate locally correctable and locally testable codes with sub-polynomial query complexity S Kopparty, O Meir, N Ron-Zewi, S Saraf
Journal of the ACM (JACM) 64 (2), 1-42, 2017
95 2017 A framework for pursuit evasion games in Rn S Kopparty, CV Ravishankar
Information Processing Letters 96 (3), 114-122, 2005
93 2005 List-decoding multiplicity codes S Kopparty
Theory of Computing 11 (1), 149-182, 2015
92 2015 Affine dispersers from subspace polynomials E Ben-Sasson, S Kopparty
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
76 2009 DEEP-FRI: sampling outside the box improves soundness E Ben-Sasson, L Goldberg, S Kopparty, S Saraf
arXiv preprint arXiv:1903.12243, 2019
75 2019 On the list-decodability of random linear codes V Guruswami, J Hastad, S Kopparty
Proceedings of the forty-second ACM symposium on Theory of computing, 409-416, 2010
71 2010 Explicit subspace designs V Guruswami, S Kopparty
Combinatorica 36 (2), 161-185, 2016
65 2016 Maximally recoverable codes for grid-like topologies P Gopalan, G Hu, S Kopparty, S Saraf, C Wang, S Yekhanin
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
64 2017 Subspace polynomials and limits to list decoding of Reed–Solomon codes E Ben-Sasson, S Kopparty, J Radhakrishnan
IEEE Transactions on Information Theory 56 (1), 113-120, 2009
64 * 2009 Equivalence of polynomial identity testing and polynomial factorization S Kopparty, S Saraf, A Shpilka
computational complexity 24, 295-331, 2015
59 * 2015 How to construct a correct and scalable iBGP configuration M Vutukuru, P Valiant, S Kopparty, H Balakrishnan
IEEE INFOCOM 2006, 2005
59 2005 Proximity gaps for reed–solomon codes E Ben-Sasson, D Carmon, Y Ishai, S Kopparty, S Saraf
Journal of the ACM 70 (5), 1-57, 2023
55 2023 Roads, codes, and spatiotemporal queries S Gupta, S Kopparty, C Ravishankar
Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on …, 2004
54 2004 Improved decoding of folded Reed-Solomon and multiplicity codes S Kopparty, N Ron-Zewi, S Saraf, M Wootters
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
42 * 2018 Certifying Polynomials for Circuits, with Applications to Lower Bounds and Circuit Compression S Kopparty, S Srinivasan
Theory of Computing 14 (1), 1-24, 2018
42 * 2018