Searching for "On Derandomizing Probabilistic Sublinear-Time Algorithms." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

On derandomizing probabilistic sublinear-time algorithms
by Marius Zimand, Marius Zimand — 2007 — In Proceedings of the 22th Annual IEEE Conference on Computational Complexity
…ON DERANDOMIZING PROBABILISTIC SUBLINEAR TIME ALGORITHMS Marius Zimand Abstract. There exists a…
Cited by 1 (0 self) – Add To MetaCart

EXPOSURE-RESILIENT EXTRACTORS AND THE DERANDOMIZATION OF PROBABILISTIC SUBLINEAR TIME ALGORITHMS
by Marius Zimand
…EXPOSURE-RESILIENT EXTRACTORS AND THE DERANDOMIZATION OF PROBABILISTIC SUBLINEAR TIME ALGORITHMS…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB