Deterministic sorting in nearly logarithmic time on the hypercube and related computers
- 2 December 1993
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 47 (3), 501-548
- https://doi.org/10.1016/0022-0000(93)90043-v
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Theoretical Aspects of VLSI Pin LimitationsSIAM Journal on Computing, 1993
- A logarithmic time sort for linear size networksJournal of the ACM, 1987
- A parallel median algorithmInformation Processing Letters, 1985
- Sorting inc logn parallel stepsCombinatorica, 1983
- Parallel permutation and sorting algorithms and a new generalized connection networkJournal of the ACM, 1982
- Quotient NetworksIEEE Transactions on Computers, 1982
- The cube-connected cycles: a versatile network for parallel computationCommunications of the ACM, 1981
- A Self-Routing Benes Network and Parallel Permutation AlgorithmsIEEE Transactions on Computers, 1981
- UltracomputersACM Transactions on Programming Languages and Systems, 1980
- Sorting networks and their applicationsPublished by Association for Computing Machinery (ACM) ,1968