Expanders that beat the eigenvalue bound: Explicit construction and applications (Q1125612): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 03:08, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Expanders that beat the eigenvalue bound: Explicit construction and applications |
scientific article |
Statements
Expanders that beat the eigenvalue bound: Explicit construction and applications (English)
0 references
8 December 1999
0 references
Improving the extractor construction of Nisan and Zuckerman a Log-space algorithm is presented that on input \(n\) and \(0<\delta<1\) constructs \(n^\delta\)-expanding graphs on \(n\) nodes with maximum degree \(n^{1-\delta+o(1)}\). The following applications are given: a \(k\)-round sorting algorithm using \(n^{1+1/k+o(1)}\) comparisons; a \(k\)-round selection algorithm using \(n^{1+1/(2^k-1)+o(1)}\) comparisons; a depth 2 superconcentrator of size \(n^{1+o(1)}\); and a depth \(k\) wide-sense nonblocking generalized connector of size \(n^{1+1/k+o(1)}\).
0 references
expander
0 references
graphs
0 references
sorting algorithm
0 references
selection algorithm
0 references
connector
0 references