Expanders that beat the eigenvalue bound: explicit construction and applications


For every $n$ and $0<\delta <1$, we construct graphs on $n$ nodes such that every two sets of size $n^{\delta}$ share an edge, having essentially optimal maximum degree $n^{1-\delta+o(1)}$. Using known and new reductions from these graphs, we derive new explicit constructions of: 1. A $k$ round sorting algorithm using $n^{1+1/k+o(1)}$ comparisons. 2. A $k… (More)
DOI: 10.1145/167088.167163


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.


Citations per Year

161 Citations

Semantic Scholar estimates that this publication has 161 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics