SORTING AND SELECTION ON DISTRIBUTED MEMORY BUS COMPUTERS

DOI10.1080/10637199608915552MaRDI QIDQ4820152zbMATHOpenAlexFDO

Authors Sanguthevar Rajasekaran, Sartaj 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

Mathematics Subject Classification ID

Searching and sorting (68P10) Computer system organization (68M99)

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3690676 (Why is no real title available?)
• Expected time bounds for selection
• Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
• Optimal bounds for decision problems on the CRCW PRAM
• Parallel Merge Sort
• Parallelism in Comparison Problems
• Sorting on PRAMs with reconfigurable buses
• Tight Bounds on the Complexity of Parallel Sorting

This page was built for publication: SORTING AND SELECTION ON DISTRIBUTED MEMORY BUS COMPUTERS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4820152)