Parallel permutation and sorting algorithms and a new generalized connection network
- 1 July 1982
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 29 (3), 642-667
- https://doi.org/10.1145/322326.322329
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Parallel Algorithms to Set Up the Benes Permutation NetworkIEEE Transactions on Computers, 1982
- Data broadcasting in SIMD computersIEEE Transactions on Computers, 1981
- An optimal routing algorithm for mesh-connected Parallel computersJournal of the ACM, 1980
- Generalized Connection Networks for Parallel Processor IntercommunicationIEEE Transactions on Computers, 1978
- Fast parallel sorting algorithmsCommunications of the ACM, 1978
- A Shuffle-Exchange Network with Simplified ControlIEEE Transactions on Computers, 1976
- Bounds to Complexities of Networks for Sorting and for SwitchingJournal of the ACM, 1975
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974
- Optimal algorithms for parallel polynomial evaluationJournal of Computer and System Sciences, 1973
- Very high-speed computing systemsProceedings of the IEEE, 1966