Sorting in Linear Time?
- 31 August 1998
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 57 (1) , 74-93
- https://doi.org/10.1006/jcss.1998.1580
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Deterministic parallel list rankingPublished by Springer Nature ,2006
- Faster deterministic sorting and searching in linear spacePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A new efficient radix sortPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Improved Parallel Integer Sorting without Concurrent WritingInformation and Computation, 1997
- Improved deterministic parallel integer sortingInformation and Computation, 1991
- Optimal bounds for decision problems on the CRCW PRAMJournal of the ACM, 1989
- Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory MachinesSIAM Journal on Computing, 1989
- Parallel Merge SortSIAM Journal on Computing, 1988
- Deterministic coin tossing with applications to optimal parallel list rankingInformation and Control, 1986
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979