|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 7 occurrences of 7 keywords
|
|
|
|
|
Results
Found 17 publication records. Showing 17 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Shubhangi Saraf, Ilya Volkovich |
Black-Box Identity Testing of Depth-4 Multilinear Circuits.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Shubhangi Saraf, Sergey Yekhanin |
Noisy Interpolation of Sparse Polynomials, and Applications. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Zeev Dvir, Shubhangi Saraf, Amir Shpilka |
Tight lower bounds for 2-query LCCs over finite fields. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Zeev Dvir, Amir Shpilka, Shubhangi Saraf |
Tight Lower Bounds for 2-query LCCs over Finite Fields. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shubhangi Saraf, Sergey Yekhanin |
Noisy Interpolation of Sparse Polynomials, and Applications. |
IEEE Conference on Computational Complexity |
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 | Shubhangi Saraf, Ilya Volkovich |
Black-box identity testing of depth-4 multilinear circuits. |
STOC |
2011 |
DBLP DOI 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 | Swastik Kopparty, Shubhangi Saraf |
Some Recent Results on Local Testing of Sparse Linear Codes. |
Property Testing |
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 | 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 | Neeraj Kayal, Shubhangi Saraf |
Blackbox Polynomial Identity Testing for Depth 3 Circuits. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Shubhangi Saraf |
Acute and nonobtuse triangulations of polyhedral surfaces. |
Eur. J. Comb. |
2009 |
DBLP DOI 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 | Neeraj Kayal, Shubhangi Saraf |
Blackbox Polynomial Identity Testing for Depth 3 Circuits. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
Sylvester, Derandomization, Arithmetic circuits |
Displaying result #1 - #17 of 17 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")