A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC '02
The main concrete result of this paper is the first explicit construction of constant degree lossless expanders. In these graphs, the expansion factor is almost as large as possible: (1 − ǫ)D, where D is the degree and ǫ is an arbitrarily small constant. The best previous explicit constructions gave expansion factor D/2, which is too weak for many applications. The D/2 bound was obtained via the eigenvalue method, and is known that that method cannot give better bounds. The main abstractdoi:10.1145/510002.510003 fatcat:zrdsw422zbdtpowpnj6a4lgs3e