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