Swastik Kopparty
Swastik Kopparty
Zugehörigkeit unbekannt
Bestätigte E-Mail-Adresse bei rutgers.edu
Zitiert von
Zitiert von
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
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
High-rate codes with sublinear-time decoding
S Kopparty, S Saraf, S Yekhanin
Journal of the ACM (JACM) 61 (5), 1-20, 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
A framework for pursuit evasion games in Rn
S Kopparty, CV Ravishankar
Information Processing Letters 96 (3), 114-122, 2005
New affine-invariant codes from lifting
A Guo, S Kopparty, M Sudan
Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013
List-decoding multiplicity codes
S Kopparty
Theory of Computing 11 (1), 149-182, 2015
Affine dispersers from subspace polynomials
E Ben-Sasson, S Kopparty
SIAM Journal on Computing 41 (4), 880-914, 2012
How to construct a correct and scalable iBGP configuration
M Vutukuru, P Valiant, S Kopparty, H Balakrishnan
IEEE INFOCOM 2006, 2005
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
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
Roads, codes, and spatiotemporal queries
S Gupta, S Kopparty, C Ravishankar
Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on …, 2004
Explicit subspace designs
V Guruswami, S Kopparty
Combinatorica 36 (2), 161-185, 2016
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
Local list-decoding and testing of random linear codes from high error
S Kopparty, S Saraf
SIAM Journal on Computing 42 (3), 1302-1326, 2013
Certifying Polynomials for Circuits, with Applications to Lower Bounds and Circuit Compression
S Kopparty, S Srinivasan
Theory of Computing 14 (1), 1-24, 2018
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
Equivalence of polynomial identity testing and polynomial factorization
S Kopparty, S Saraf, A Shpilka
computational complexity 24 (2), 295-331, 2015
Tolerant linearity testing and locally testable codes
S Kopparty, S Saraf
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009
Constant rate PCPs for circuit-SAT with sublinear query complexity
E Ben-Sasson, Y Kaplan, S Kopparty, O Meir, H Stichtenoth
Journal of the ACM (JACM) 63 (4), 1-57, 2016
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20