The SCEAS System
Navigation Menu

Search the dblp DataBase


Swastik Kopparty: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Elena Grigorescu, Swastik Kopparty, Madhu Sudan
    Local Decoding and Testing for Homomorphisms. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:375-385 [Conf]
  2. 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]
  3. Sandeep Gupta, Swastik Kopparty, Chinya V. Ravishankar
    Roads, Codes and Spatiotemporal Queries. [Citation Graph (0, 0)][DBLP]
    PODS, 2004, pp:115-124 [Conf]
  4. 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]
  5. 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]

  6. Tolerant Linearity Testing and Locally Testable Codes. [Citation Graph (, )][DBLP]

  7. Detecting Rational Points on Hypersurfaces over Finite Fields. [Citation Graph (, )][DBLP]

  8. On the Communication Complexity of Read-Once AC^0 Formulae. [Citation Graph (, )][DBLP]

  9. Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers. [Citation Graph (, )][DBLP]

  10. Decodability of group homomorphisms beyond the johnson bound. [Citation Graph (, )][DBLP]

  11. Random graphs and the parity quantifier. [Citation Graph (, )][DBLP]

  12. Affine dispersers from subspace polynomials. [Citation Graph (, )][DBLP]

  13. On the list-decodability of random linear codes. [Citation Graph (, )][DBLP]

  14. Local list-decoding and testing of random linear codes from high error. [Citation Graph (, )][DBLP]

  15. Optimal Testing of Reed-Muller Codes [Citation Graph (, )][DBLP]

  16. On the List-Decodability of Random Linear Codes [Citation Graph (, )][DBLP]

  17. Decodability of Group Homomorphisms beyond the Johnson Bound. [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.004secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002