Algorithms and average time bounds of sorting on a mesh-connected computer
- 1 March 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 5 (3) , 308-315
- https://doi.org/10.1109/71.277787
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Optimal sorting on multi-dimensionally mesh-connected computersPublished by Springer Nature ,2006
- Concentrated regular data streams on grids: sorting and routing near to the bisection boundPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Randomized sorting and selection on mesh-connected processor arrays (preliminary version)Published by Association for Computing Machinery (ACM) ,1991
- Sorting within distance bound on a mesh-connected processor arrayPublished by Springer Nature ,1989
- Lower bounds for sorting on mesh-connected architecturesActa Informatica, 1987
- Systolic Sorting on a Mesh-Connected NetworkIEEE Transactions on Computers, 1985
- Tight Bounds on the Complexity of Parallel SortingIEEE Transactions on Computers, 1985
- An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting SchemesIEEE Transactions on Computers, 1983
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952