Almost Optimal Dispersers

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 .

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Additional information

Received November 12, 1998/Revised June 20, 2000

RID="*"

ID="*" This work was partially done while the author was at the Department of Computer Science, Weizmann Institute of Science, Rehovot, Israel. This work was supported by a Phil Zacharia postdoctoral fellowship.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Ta-Shma, A. Almost Optimal Dispersers. Combinatorica 22, 123–145 (2002). https://doi.org/10.1007/s004930200006

Download citation

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