Expanders that beat the eigenvalue bound: Explicit construction and applications

Avi Wigderson, David Zuckerman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

31 Scopus citations

Abstract

For every n and 0 < 6 < 1, we construct graphs on n nodes such that every two sets of size n6 share an edge, having essentially optimal maximum degree n1-b+o(1) We USe them to explicitly construct: A k round sorting algorithm using n1+1(2k-1)+o(1)) comparisons. A k round selection algorithm using n1+1/k+o(1) comparisons. A depth 2 superconcentrator of size A depth k wide-sense nonblocking generalized connector of size + All of these results improve on previous constructions by factors of nΩ(l) and are optimal to within factors of no1).

Original languageEnglish
Title of host publicationProceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993
PublisherAssociation for Computing Machinery
Pages245-251
Number of pages7
ISBN (Electronic)0897915917
DOIs
StatePublished - 1 Jun 1993
Event25th Annual ACM Symposium on Theory of Computing, STOC 1993 - San Diego, United States
Duration: 16 May 199318 May 1993

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
VolumePart F129585
ISSN (Print)0737-8017

Conference

Conference25th Annual ACM Symposium on Theory of Computing, STOC 1993
Country/TerritoryUnited States
CitySan Diego
Period16/05/9318/05/93

Bibliographical note

Publisher Copyright:
© 1993 ACM.

Fingerprint

Dive into the research topics of 'Expanders that beat the eigenvalue bound: Explicit construction and applications'. Together they form a unique fingerprint.

Cite this