MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Almost Optimal Dispersers." – sorted by Relevance.

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

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

3 documents found, showing 1 through 3.

ATOM

Almost Optimal Dispersers
by Amnon Ta-shma — 1998 — In Proceedings of the 30th Annual ACM Symposium on Theory of Computing
…Almost Optimal Dispersers Amnon Ta-Shma ICSI Abstract A (K; ffl) disperser graph G = (V 1 ; V 2…
Cited by 21 (3 self) – Add To MetaCart

Near-Optimal conversion of Hardness into Pseudo-Randomness
by Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson — 1999 — In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science
… construction, we get an almost optimal disperser. 1. Introduction This paper addresses the question…
Cited by 28 (9 self) – Add To MetaCart

Near-Optimal conversion of Hardness into Pseudo-Randomness
by unknown authors
… an almost optimal disperser. 1. Introduction This paper addresses the question of hardness versus ran…
Add To MetaCart

Showing 1 through 3.

ATOM

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