Linear sorting withO(logn) processors
- 1 June 1983
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 23 (2) , 170-180
- https://doi.org/10.1007/bf02218438
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Computing turning points of curves implicitly defined by nonlinear equations depending on a parameterComputing, 1981
- Fast parallel sorting algorithmsCommunications of the ACM, 1978
- New Parallel-Sorting SchemesIEEE Transactions on Computers, 1978
- Sorting by distributive partitioningInformation Processing Letters, 1978
- The analysis of Quicksort programsActa Informatica, 1977
- Finding the medianJournal of Computer and System Sciences, 1976
- Expected time bounds for selectionCommunications of the ACM, 1975
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- QuicksortThe Computer Journal, 1962
- Algorithm 64: QuicksortCommunications of the ACM, 1961