Almost optimal dispersers

Amnon Ta-Shma*

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

14 Scopus citations


A (k, ε) disperser graph G = (V1, V2, E) is a bipartite graph with the property that any subset A is contained as a subset within V1 of cardinality K, the neighbor of A cover at least 1-ε fraction of the vertices of V2. Such graphs have many applications in deramdomization. An explicit construction of (K = 2k, ε) disperser graphs G = (V = [2n], W, E) with an almost optimal degree D = poly(n, ε-1), for every k≥NΩ(1) is extended for any parameter k≤n.

Original languageEnglish
Pages (from-to)196-202
Number of pages7
JournalConference Proceedings of the Annual ACM Symposium on Theory of Computing
StatePublished - 1998
Externally publishedYes
EventProceedings of the 1998 30th Annual ACM Symposium on Theory of Computing - Dallas, TX, USA
Duration: 23 May 199826 May 1998


Dive into the research topics of 'Almost optimal dispersers'. Together they form a unique fingerprint.

Cite this