Optimal Parallel Sorting Scheme by Order Statistics
- 1 December 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 16 (6) , 990-1003
- https://doi.org/10.1137/0216063
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A taxonomy of parallel sortingACM Computing Surveys, 1984
- Parallel permutation and sorting algorithms and a new generalized connection networkJournal of the ACM, 1982
- Approximation Theorems of Mathematical StatisticsPublished by Wiley ,1980
- On the Asymptotic Distribution of $k$-Spacings with Applications to Goodness-of-Fit TestsThe Annals of Statistics, 1979
- Fast parallel sorting algorithmsCommunications of the ACM, 1978
- Bounds to Complexities of Networks for Sorting and for SwitchingJournal of the ACM, 1975
- Parallel Processing with the Perfect ShuffleIEEE Transactions on Computers, 1971
- Samplesort: A Sampling Approach to Minimal Storage Tree SortingJournal of the ACM, 1970
- Some properties of the negative hypergeometric distribution and its limit distributionsMetrika, 1968
- Moments of Order Statistics from the Equicorrelated Multivariate Normal DistributionThe Annals of Mathematical Statistics, 1962