Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications |
| |
Authors: | Avi Wigderson David Zuckerman |
| |
Affiliation: | (1) Institute of Computer Science, Hebrew University of Jerusalem; Israel, 91904; E-mail: avi@cs.huji.ac.il, IL;(2) Dept. of Computer Sciences, The University of Texas at Austin; Austin, TX 78712; E-mail: diz@cs.utexas.edu, US |
| |
Abstract: | n and 0 < δ < 1, we construct graphs on n nodes such that every two sets of size share an edge, having essentially optimal maximum degree . Using known and new reductions from these graphs, we derive new explicit constructions of: 1. A k round sorting algorithm using comparisons. 2. A k round selection algorithm using comparisons. 3. A depth 2 superconcentrator of size . 4. A depth k wide-sense nonblocking generalized connector of size . All of these results improve on previous constructions by factors of , and are optimal to within factors of . These results are based on an improvement to the extractor construction of Nisan & Zuckerman: our algorithm extracts an asymptotically optimal number of random bits from a defective random source using a small additional number of truly random bits. Received: June 13, 1995/Revised: Revised October 23, 1998 |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|