A new parallel sorting algorithm based upon min-mid-max operations
- 1 June 1984
- journal article
- research article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 24 (2) , 187-195
- https://doi.org/10.1007/bf01937485
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Parallel permutation and sorting algorithms and a new generalized connection networkJournal of the ACM, 1982
- Parallel complexity of sorting problemsJournal of Algorithms, 1982
- A parallel merging algorithmInformation Processing Letters, 1981
- Parallel Sorting with Constant Time for ComparisonsSIAM Journal on Computing, 1981
- Diamond a sorting method for vector machinesBIT Numerical Mathematics, 1981
- Fast Sorting Algorithms on Uniform Ladders (Multiple Shift-Register Loops)IEEE Transactions on Computers, 1980
- Optimal Sorting Algorithms for Parallel ComputersIEEE Transactions on Computers, 1978
- Lower Bounds on Merging NetworksJournal of the ACM, 1976
- Merging with parallel processorsCommunications of the ACM, 1975
- Bounds to Complexities of Networks for Sorting and for SwitchingJournal of the ACM, 1975