The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Swastik Kopparty" ( http://dblp.L3S.de/Authors/Swastik_Kopparty )

  Author page on DBLP  Author page in RDF  Community of Swastik Kopparty in ASPL-2

Publication years (Num. hits)
2004-2009 (18) 2010-2011 (15) 2012 (1)
Publication types (Num. hits)
article(16) inproceedings(18)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 11 occurrences of 7 keywords

Results
Found 34 publication records. Showing 34 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Swastik Kopparty List-Decoding Multiplicity Codes. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Swastik Kopparty, Benjamin Rossman The homomorphism domination exponent. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Swastik Kopparty Review of algebraic function fields and codes by Henning Stichtenoth. Search on Bibsonomy SIGACT News The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Venkatesan Guruswami, Johan Håstad, Swastik Kopparty On the List-Decodability of Random Linear Codes. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin High-rate codes with sublinear-time decoding. Search on Bibsonomy STOC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Swastik Kopparty On the complexity of powering in finite fields. Search on Bibsonomy STOC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Eli Ben-Sasson, Swastik Kopparty Affine Dispersers from Subspace Polynomials. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin High-rate codes with sublinear-time decoding. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Venkatesan Guruswami, Johan Håstad, Swastik Kopparty On the List-Decodability of Random Linear Codes. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Venkatesan Guruswami, Johan Håstad, Swastik Kopparty On the List-Decodability of Random Linear Codes Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan Subspace polynomials and limits to list decoding of Reed-Solomon codes. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Swastik Kopparty, Shubhangi Saraf Some Recent Results on Local Testing of Sparse Linear Codes. Search on Bibsonomy Property Testing The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman Optimal Testing of Reed-Muller Codes. Search on Bibsonomy Property Testing The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman Optimal Testing of Reed-Muller Codes. Search on Bibsonomy FOCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Swastik Kopparty, Shubhangi Saraf Local list-decoding and testing of random linear codes from high error. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF dual-BCH codes, noisy parity, random codes, property testing, list-decoding, sublinear-time algorithms
1Venkatesan Guruswami, Johan Håstad, Swastik Kopparty On the list-decodability of random linear codes. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Phokion G. Kolaitis, Swastik Kopparty Random Graphs and the Parity Quantifier. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman Optimal testing of Reed-Muller codes. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan Extensions to the Method of Multiplicities, with applications to Kakeya Sets and Mergers. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Swastik Kopparty, Shubhangi Saraf Local list-decoding and testing of random linear codes from high-error. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman Optimal Testing of Reed-Muller Codes Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Swastik Kopparty, Shubhangi Saraf Tolerant Linearity Testing and Locally Testable Codes. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers. Search on Bibsonomy FOCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Polynomial method, Randomness, Extractors
1T. S. Jayram, Swastik Kopparty, Prasad Raghavendra On the Communication Complexity of Read-Once AC^0 Formulae. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Phokion G. Kolaitis, Swastik Kopparty Random graphs and the parity quantifier. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF 0-1 law, AC0, modular convergence, first-order logic
1Eli Ben-Sasson, Swastik Kopparty Affine dispersers from subspace polynomials. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF randomness, extractors
1Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan Decodability of Group Homomorphisms beyond the Johnson Bound. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2008 DBLP  BibTeX  RDF
1Swastik Kopparty, Sergey Yekhanin Detecting Rational Points on Hypersurfaces over Finite Fields. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Chevalley-Warning Theorem, Lang-Weil Theorem, Nonsingular Spaces of Matrices, Polynomial Identity Testing
1Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan Decodability of group homomorphisms beyond the johnson bound. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF hadamard codes, list decoding, sublinear time algorithms
1Mythili Vutukuru, Paul Valiant, Swastik Kopparty, Hari Balakrishnan How to Construct a Correct and Scalable iBGP Configuration. Search on Bibsonomy INFOCOM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Elena Grigorescu, Swastik Kopparty, Madhu Sudan Local Decoding and Testing for Homomorphisms. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan Subspace Polynomials and List Decoding of Reed-Solomon Codes. Search on Bibsonomy FOCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Swastik Kopparty, Chinya V. Ravishankar A framework for pursuit evasion games in Rn. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Sandeep Gupta, Swastik Kopparty, Chinya V. Ravishankar Roads, Codes and Spatiotemporal Queries. (PDF / PS) Search on Bibsonomy PODS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #34 of 34 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.