SORTING AND SELECTION ON DISTRIBUTED MEMORY BUS COMPUTERS

DOI10.1080/10637199608915552zbMATH Open1049.68568OpenAlexW3021634912MaRDI QIDQ4820152FDOQ4820152

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

• Title not available (Why is that?)
• Parallelism in Comparison Problems
• Title not available (Why is that?)
• Optimal bounds for decision problems on the CRCW PRAM
• Parallel Merge Sort
• Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
• Expected time bounds for selection
• Tight Bounds on the Complexity of Parallel Sorting
• Sorting on PRAMs with reconfigurable buses

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)