|
Search the dblp DataBase
Swastik Kopparty:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Elena Grigorescu, Swastik Kopparty, Madhu Sudan
Local Decoding and Testing for Homomorphisms. [Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2006, pp:375-385 [Conf]
- Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan
Subspace Polynomials and List Decoding of Reed-Solomon Codes. [Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:207-216 [Conf]
- Sandeep Gupta, Swastik Kopparty, Chinya V. Ravishankar
Roads, Codes and Spatiotemporal Queries. [Citation Graph (0, 0)][DBLP] PODS, 2004, pp:115-124 [Conf]
- Swastik Kopparty, Chinya V. Ravishankar
A framework for pursuit evasion games in Rn. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2005, v:96, n:3, pp:114-122 [Journal]
- Mythili Vutukuru, Paul Valiant, Swastik Kopparty, Hari Balakrishnan
How to Construct a Correct and Scalable iBGP Configuration. [Citation Graph (0, 0)][DBLP] INFOCOM, 2006, pp:- [Conf]
Tolerant Linearity Testing and Locally Testable Codes. [Citation Graph (, )][DBLP]
Detecting Rational Points on Hypersurfaces over Finite Fields. [Citation Graph (, )][DBLP]
On the Communication Complexity of Read-Once AC^0 Formulae. [Citation Graph (, )][DBLP]
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers. [Citation Graph (, )][DBLP]
Decodability of group homomorphisms beyond the johnson bound. [Citation Graph (, )][DBLP]
Random graphs and the parity quantifier. [Citation Graph (, )][DBLP]
Affine dispersers from subspace polynomials. [Citation Graph (, )][DBLP]
On the list-decodability of random linear codes. [Citation Graph (, )][DBLP]
Local list-decoding and testing of random linear codes from high error. [Citation Graph (, )][DBLP]
Optimal Testing of Reed-Muller Codes [Citation Graph (, )][DBLP]
On the List-Decodability of Random Linear Codes [Citation Graph (, )][DBLP]
Decodability of Group Homomorphisms beyond the Johnson Bound. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
|