|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
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 |
| 1 | Swastik Kopparty |
List-Decoding Multiplicity Codes.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Swastik Kopparty, Benjamin Rossman |
The homomorphism domination exponent.  |
Eur. J. Comb.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Swastik Kopparty |
Review of algebraic function fields and codes by Henning Stichtenoth.  |
SIGACT News  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Johan Håstad, Swastik Kopparty |
On the List-Decodability of Random Linear Codes.  |
IEEE Transactions on Information Theory  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin |
High-rate codes with sublinear-time decoding.  |
STOC  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Swastik Kopparty |
On the complexity of powering in finite fields.  |
STOC  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Swastik Kopparty |
Affine Dispersers from Subspace Polynomials.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin |
High-rate codes with sublinear-time decoding.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Johan Håstad, Swastik Kopparty |
On the List-Decodability of Random Linear Codes.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Johan Håstad, Swastik Kopparty |
On the List-Decodability of Random Linear Codes  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan |
Subspace polynomials and limits to list decoding of Reed-Solomon codes.  |
IEEE Transactions on Information Theory  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Swastik Kopparty, Shubhangi Saraf |
Some Recent Results on Local Testing of Sparse Linear Codes.  |
Property Testing ![In: Property Testing - Current Research and Surveys [outgrow of a workshop at the Institute for Computer Science (ITCS) at Tsinghua University, January 2010], pp. 320-333, 2010, Springer, 978-3-642-16366-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman |
Optimal Testing of Reed-Muller Codes.  |
Property Testing ![In: Property Testing - Current Research and Surveys [outgrow of a workshop at the Institute for Computer Science (ITCS) at Tsinghua University, January 2010], pp. 269-275, 2010, Springer, 978-3-642-16366-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman |
Optimal Testing of Reed-Muller Codes.  |
FOCS  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Swastik Kopparty, Shubhangi Saraf |
Local list-decoding and testing of random linear codes from high error.  |
STOC  |
2010 |
DBLP DOI BibTeX RDF |
dual-BCH codes, noisy parity, random codes, property testing, list-decoding, sublinear-time algorithms |
| 1 | Venkatesan Guruswami, Johan Håstad, Swastik Kopparty |
On the list-decodability of random linear codes.  |
STOC  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Phokion G. Kolaitis, Swastik Kopparty |
Random Graphs and the Parity Quantifier.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman |
Optimal testing of Reed-Muller codes.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan |
Extensions to the Method of Multiplicities, with applications to Kakeya Sets and Mergers.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Swastik Kopparty, Shubhangi Saraf |
Local list-decoding and testing of random linear codes from high-error.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman |
Optimal Testing of Reed-Muller Codes  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Swastik Kopparty, Shubhangi Saraf |
Tolerant Linearity Testing and Locally Testable Codes.  |
APPROX-RANDOM  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan |
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers.  |
FOCS  |
2009 |
DBLP DOI BibTeX RDF |
Polynomial method, Randomness, Extractors |
| 1 | T. S. Jayram, Swastik Kopparty, Prasad Raghavendra |
On the Communication Complexity of Read-Once AC^0 Formulae.  |
IEEE Conference on Computational Complexity  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Phokion G. Kolaitis, Swastik Kopparty |
Random graphs and the parity quantifier.  |
STOC  |
2009 |
DBLP DOI BibTeX RDF |
0-1 law, AC0, modular convergence, first-order logic |
| 1 | Eli Ben-Sasson, Swastik Kopparty |
Affine dispersers from subspace polynomials.  |
STOC  |
2009 |
DBLP DOI BibTeX RDF |
randomness, extractors |
| 1 | Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan |
Decodability of Group Homomorphisms beyond the Johnson Bound.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Swastik Kopparty, Sergey Yekhanin |
Detecting Rational Points on Hypersurfaces over Finite Fields.  |
IEEE Conference on Computational Complexity  |
2008 |
DBLP DOI BibTeX RDF |
Chevalley-Warning Theorem, Lang-Weil Theorem, Nonsingular Spaces of Matrices, Polynomial Identity Testing |
| 1 | Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan |
Decodability of group homomorphisms beyond the johnson bound.  |
STOC  |
2008 |
DBLP DOI BibTeX RDF |
hadamard codes, list decoding, sublinear time algorithms |
| 1 | Mythili Vutukuru, Paul Valiant, Swastik Kopparty, Hari Balakrishnan |
How to Construct a Correct and Scalable iBGP Configuration.  |
INFOCOM  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Elena Grigorescu, Swastik Kopparty, Madhu Sudan |
Local Decoding and Testing for Homomorphisms.  |
APPROX-RANDOM  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan |
Subspace Polynomials and List Decoding of Reed-Solomon Codes.  |
FOCS  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Swastik Kopparty, Chinya V. Ravishankar |
A framework for pursuit evasion games in Rn.  |
Inf. Process. Lett.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandeep Gupta, Swastik Kopparty, Chinya V. Ravishankar |
Roads, Codes and Spatiotemporal Queries. (PDF / PS)  |
PODS  |
2004 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #34 of 34 (100 per page; Change: )
|
|