 | 2009 |
|---|
| 12 |       | Swastik Kopparty,
Shubhangi Saraf:
Tolerant Linearity Testing and Locally Testable Codes.
APPROX-RANDOM 2009: 601-614 |
| 11 | | Eli Ben-Sasson,
Swastik Kopparty:
Affine dispersers from subspace polynomials.
STOC 2009: 65-74 |
| 10 | | Phokion G. Kolaitis,
Swastik Kopparty:
Random graphs and the parity quantifier.
STOC 2009: 705-714 |
| 9 | | Arnab Bhattacharyya,
Swastik Kopparty,
Grant Schoenebeck,
Madhu Sudan,
David Zuckerman:
Optimal Testing of Reed-Muller Codes
CoRR abs/0910.0641: (2009) |
| 2008 |
|---|
| 8 | | Swastik Kopparty,
Sergey Yekhanin:
Detecting Rational Points on Hypersurfaces over Finite Fields.
IEEE Conference on Computational Complexity 2008: 311-320 |
| 7 | | Irit Dinur,
Elena Grigorescu,
Swastik Kopparty,
Madhu Sudan:
Decodability of group homomorphisms beyond the johnson bound.
STOC 2008: 275-284 |
| 6 | | Irit Dinur,
Elena Grigorescu,
Swastik Kopparty,
Madhu Sudan:
Decodability of Group Homomorphisms beyond the Johnson Bound.
Electronic Colloquium on Computational Complexity (ECCC) 15(020): (2008) |
| 2006 |
|---|
| 5 | | Elena Grigorescu,
Swastik Kopparty,
Madhu Sudan:
Local Decoding and Testing for Homomorphisms.
APPROX-RANDOM 2006: 375-385 |
| 4 | | Eli Ben-Sasson,
Swastik Kopparty,
Jaikumar Radhakrishnan:
Subspace Polynomials and List Decoding of Reed-Solomon Codes.
FOCS 2006: 207-216 |
| 3 | | Mythili Vutukuru,
Paul Valiant,
Swastik Kopparty,
Hari Balakrishnan:
How to Construct a Correct and Scalable iBGP Configuration.
INFOCOM 2006 |
| 2005 |
|---|
| 2 | | Swastik Kopparty,
Chinya V. Ravishankar:
A framework for pursuit evasion games in Rn.
Inf. Process. Lett. 96(3): 114-122 (2005) |
| 2004 |
|---|
| 1 | | Sandeep Gupta,
Swastik Kopparty,
Chinya V. Ravishankar:
Roads, Codes and Spatiotemporal Queries.
PODS 2004: 115-124 |
