|
|
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 |
49 | D. Sivakumar |
Algorithmic derandomization via complexity theory. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
49 | D. Sivakumar |
Algorithmic Derandomization via Complexity Theory. |
CCC |
2002 |
DBLP DOI BibTeX RDF |
Johnson-Lindenstrauss Lemma, Derandomization, randomized rounding |
40 | Sixia Chen, Cristopher Moore, Alexander Russell |
Small-Bias Sets for Nonabelian Groups - Derandomizations of the Alon-Roichman Theorem. |
APPROX-RANDOM |
2013 |
DBLP DOI BibTeX RDF |
|
40 | Benjamin Doerr |
Randomly Rounding Rationals with Cardinality Constraints and Derandomizations. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
|
40 | Benjamin Doerr |
Generating Randomized Roundings with Cardinality Constraints and Derandomizations. |
STACS |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Sorin Istrail |
Constructing Generalized Universal Traversing Sequences of Polynomial Size for Graphs with Small Diameter (Extended Abstract) |
FOCS |
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 |
25 | Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel |
Pseudorandom Generators and Typically-Correct Derandomization. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
25 | John M. Hitchcock, Aduri Pavan |
Hardness Hypotheses, Derandomization, and Circuit Complexity. |
Comput. Complex. |
2008 |
DBLP DOI BibTeX RDF |
68Q30, 68Q17, Subject classification. 68Q15 |
25 | Amir Shpilka, Avi Wigderson |
Derandomizing homomorphism testing in general groups. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
homomorphism testing, derandomization, linearity testing |
25 | Eli Ben-Sasson, Madhu Sudan 0001, Salil P. Vadhan, Avi Wigderson |
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. |
STOC |
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: )
|
|