SORTING AND SELECTION ON DISTRIBUTED MEMORY BUS COMPUTERS
From MaRDI portal
Publication:4820152
DOI10.1080/10637199608915552zbMath1049.68568MaRDI QIDQ4820152
Sanguthevar Rajasekaran, Sartaj K. Sahni
Publication date: 6 October 2004
Published in: Parallel Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10637199608915552
Cites Work
- Unnamed Item
- Unnamed Item
- Sorting on PRAMs with reconfigurable buses
- Tight Bounds on the Complexity of Parallel Sorting
- Parallel Merge Sort
- Expected time bounds for selection
- Parallelism in Comparison Problems
- Optimal bounds for decision problems on the CRCW PRAM
- Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms