A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Expanders, sorting in rounds and superconcentrators of limited depth
1985
Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85
A b&act Expanding graphs and superconccntrators are relevant to theoretical computer science in several ways. Here WC use finite geometries to construct explicitly highly expanding graphs with essentially the smallest -possible number of edges. Our graphs enable us to improve significantly previous results on a parallel sorting problem, by descrilbing an explicit algorithm to sort n elements in k time units using O(nPk) processors, where, e.g., ap = 7/4. Using our graphs we can also construct
doi:10.1145/22145.22156
dblp:conf/stoc/Alon85
fatcat:pksf5i2bt5debldvwk2kfk57gm