Improved Parallel Integer Sorting without Concurrent Writing
- 1 July 1997
- journal article
- Published by Elsevier in Information and Computation
- Vol. 136 (1) , 25-51
- https://doi.org/10.1006/inco.1997.2632
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Sublogarithmic searching without multiplicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fast Parallel Space Allocation, Estimation, and Integer SortingInformation and Computation, 1995
- Prefix graphs and their applicationsPublished by Springer Nature ,1995
- Sorting in linear time?Published by Association for Computing Machinery (ACM) ,1995
- Surpassing the information theoretic bound with fusion treesJournal of Computer and System Sciences, 1993
- On Parallel Integer MergingInformation and Computation, 1993
- Improved deterministic parallel integer sortingInformation and Computation, 1991
- Parallel Merge SortSIAM Journal on Computing, 1988
- Deterministic coin tossing with applications to optimal parallel list rankingInformation and Control, 1986
- Sorting networks and their applicationsPublished by Association for Computing Machinery (ACM) ,1968