Can every randomized algorithm be derandomized?
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Russell Impagliazzo
Can every randomized algorithm be derandomized?
STOC, 2006.

STOC 2006
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-2006-Impagliazzo,
	author        = "Russell Impagliazzo",
	booktitle     = "{Proceedings of the 38th Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/1132516.1132571",
	isbn          = "1-59593-134-1",
	pages         = "373--374",
	publisher     = "{ACM}",
	title         = "{Can every randomized algorithm be derandomized?}",
	year          = 2006,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.