Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Michael Viderman" ( http://dblp.L3S.de/Authors/Michael_Viderman )

  Author page on DBLP  Author page in RDF  Community of Michael Viderman in ASPL-2

Publication years (Num. hits)
2008 (1) 2009 (5) 2010 (7) 2011 (5) 2012 (1)
Publication types (Num. hits)
article(12) inproceedings(7)
Venues (Conferences, Journals, ...)
Electronic Colloquium on Compu...(9) APPROX-RANDOM(4) IEEE Conference on Computation...(2) CoRR(1) ITCS(1) SIAM J. Comput.(1) Theory of Computing(1)
Authors
Michael Viderman(19) Eli Ben-Sasson(12) Tali Kaufman(5) Madhu Sudan(3) Venkatesan Guruswami(3)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.
Results
Found 19 publication records. Showing 19 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Michael Viderman Linear time decoding of regular expander codes. Search on Bibsonomy ITCS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Michael Viderman Linear time decoding of regular expander codes. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Michael Viderman A Combination of Testability and Decodability by Tensor Products. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Eli Ben-Sasson, Michael Viderman Composition of semi-LTCs by two-wise Tensor Products. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Michael Viderman A Combination of Testability and Decodability by Tensor Products Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Eli Ben-Sasson, Michael Viderman Towards Lower Bounds on Locally Testable Codes via Density Arguments. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Eli Ben-Sasson, Michael Viderman Towards lower bounds on locally testable codes via density arguments. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Tali Kaufman, Michael Viderman Locally Testable vs. Locally Decodable Codes. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Eli Ben-Sasson, Michael Viderman Low Rate Is Insufficient for Local Testability. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Michael Viderman A Note on high-rate Locally Testable Codes with sublinear query complexity. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman Locally Testable Codes Require Redundant Testers. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Tali Kaufman, Michael Viderman Locally Testable vs. Locally Decodable Codes. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Eli Ben-Sasson, Michael Viderman Low Rate Is Insufficient for Local Testability. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman Locally Testable Codes Require Redundant Testers. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Eli Ben-Sasson, Michael Viderman Tensor Products of Weakly Smooth Codes are Robust. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Eli Ben-Sasson, Michael Viderman Tensor Products of Weakly Smooth Codes are Robust. Search on Bibsonomy Theory of Computing The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Eli Ben-Sasson, Michael Viderman Composition of Semi-LTCs by Two-Wise Tensor Products. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman Locally Testable Codes Require Redundant Testers. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Eli Ben-Sasson, Michael Viderman Tensor Products of Weakly Smooth Codes Are Robust. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #19 of 19 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.