Expanders that beat the eigenvalue bound: Explicit construction and applications

Avi Wigderson; David Zuckerman

doi:10.1145/167088.167163

Expanders that beat the eigenvalue bound: Explicit construction and applications

Avi Wigderson
, David Zuckerman

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

32 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 n^1-b+o(1) We USe them to explicitly construct: A k round sorting algorithm using n^{1+1(2k-1)+o(1)}) comparisons. A k round selection algorithm using n^1+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 language	English
Title of host publication	Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993
Publisher	Association for Computing Machinery
Pages	245-251
Number of pages	7
ISBN (Electronic)	0897915917
DOIs	https://doi.org/10.1145/167088.167163
State	Published - 1 Jun 1993
Event	25th Annual ACM Symposium on Theory of Computing, STOC 1993 - San Diego, United States Duration: 16 May 1993 → 18 May 1993

Publication series

Name	Proceedings of the Annual ACM Symposium on Theory of Computing
Volume	Part F129585
ISSN (Print)	0737-8017

Conference

Conference	25th Annual ACM Symposium on Theory of Computing, STOC 1993
Country/Territory	United States
City	San Diego
Period	16/05/93 → 18/05/93

Bibliographical note

Publisher Copyright:
© 1993 ACM.

Access to Document

10.1145/167088.167163

Cite this

Wigderson, A., & Zuckerman, D. (1993). Expanders that beat the eigenvalue bound: Explicit construction and applications. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993 (pp. 245-251). (Proceedings of the Annual ACM Symposium on Theory of Computing; Vol. Part F129585). Association for Computing Machinery. https://doi.org/10.1145/167088.167163

@inproceedings{07daee0433c442f8a2877cc321f7730c,

title = "Expanders that beat the eigenvalue bound: Explicit construction and applications",

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).",

author = "Avi Wigderson and David Zuckerman",

note = "Publisher Copyright: {\textcopyright} 1993 ACM.; 25th Annual ACM Symposium on Theory of Computing, STOC 1993 ; Conference date: 16-05-1993 Through 18-05-1993",

year = "1993",

month = jun,

day = "1",

doi = "10.1145/167088.167163",

language = "אנגלית",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "Association for Computing Machinery",

pages = "245--251",

booktitle = "Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993",

}

Wigderson, A & Zuckerman, D 1993, Expanders that beat the eigenvalue bound: Explicit construction and applications. in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993. Proceedings of the Annual ACM Symposium on Theory of Computing, vol. Part F129585, Association for Computing Machinery, pp. 245-251, 25th Annual ACM Symposium on Theory of Computing, STOC 1993, San Diego, United States, 16/05/93. https://doi.org/10.1145/167088.167163

Expanders that beat the eigenvalue bound: Explicit construction and applications. / Wigderson, Avi; Zuckerman, David.
Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993. Association for Computing Machinery, 1993. p. 245-251 (Proceedings of the Annual ACM Symposium on Theory of Computing; Vol. Part F129585).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Expanders that beat the eigenvalue bound

T2 - 25th Annual ACM Symposium on Theory of Computing, STOC 1993

AU - Wigderson, Avi

AU - Zuckerman, David

PY - 1993/6/1

Y1 - 1993/6/1

N2 - 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).

AB - 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).

UR - https://www.scopus.com/pages/publications/0027306477

U2 - 10.1145/167088.167163

DO - 10.1145/167088.167163

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0027306477

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 245

EP - 251

BT - Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993

PB - Association for Computing Machinery

Y2 - 16 May 1993 through 18 May 1993

ER -

Expanders that beat the eigenvalue bound: Explicit construction and applications

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this