The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for derandomizations with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1990-2013 (10)
Publication types (Num. hits)
article(1) inproceedings(9)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 14 occurrences of 11 keywords

Results
Found 10 publication records. Showing 10 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
49D. Sivakumar Algorithmic derandomization via complexity theory. Search on Bibsonomy STOC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
49D. Sivakumar Algorithmic Derandomization via Complexity Theory. Search on Bibsonomy CCC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Johnson-Lindenstrauss Lemma, Derandomization, randomized rounding
40Sixia Chen, Cristopher Moore, Alexander Russell Small-Bias Sets for Nonabelian Groups - Derandomizations of the Alon-Roichman Theorem. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
40Benjamin Doerr Randomly Rounding Rationals with Cardinality Constraints and Derandomizations. Search on Bibsonomy STACS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
40Benjamin Doerr Generating Randomized Roundings with Cardinality Constraints and Derandomizations. Search on Bibsonomy STACS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
36Sorin Istrail Constructing Generalized Universal Traversing Sequences of Polynomial Size for Graphs with Small Diameter (Extended Abstract) Search on Bibsonomy FOCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF polynomial-size, generalized universal traversing sequences, polynomial size for graphs, small diameter, labeled undirected graphs, edge labels, derandomizations, finite automaton, space-bounded computation
25Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel Pseudorandom Generators and Typically-Correct Derandomization. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
25John M. Hitchcock, Aduri Pavan Hardness Hypotheses, Derandomization, and Circuit Complexity. Search on Bibsonomy Comput. Complex. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF 68Q30, 68Q17, Subject classification. 68Q15
25Amir Shpilka, Avi Wigderson Derandomizing homomorphism testing in general groups. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF homomorphism testing, derandomization, linearity testing
25Eli Ben-Sasson, Madhu Sudan 0001, Salil P. Vadhan, Avi Wigderson Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF property testing, probabilistically checkable proofs, locally testable codes, linearity testing, low degree testing
Displaying result #1 - #10 of 10 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license