, Volume 22, Issue 1, pp 123–145 | Cite as

Almost Optimal Dispersers

  • Amnon Ta-Shma
Original Paper

A \(\) disperser is a bipartite graph \(\) with the property that every subset A of \(\) of cardinality at least K, has at least \(\) fraction of the vertices of \(\) as neighbors. Such graphs have many applications in derandomization. Saks, Srinivasan and Zhou presented an explicit construction of a \(\) disperser \(\) with an almost optimal degree \(\), for every \(\). We extend their result for every parameter \(\).

AMS Subject Classification (2000) Classes:  68Q01, 68R10 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© János Bolyai Mathematical Society, 2002

Authors and Affiliations

  • Amnon Ta-Shma
    • 1
  1. 1.Computer Science Department, Tel-Aviv University; Israel 69978; E-mail:

Personalised recommendations