An optimal parallel adaptive sorting algorithm
From MaRDI portal
Publication:1182099
DOI10.1016/0020-0190(91)90179-LzbMath0735.68020MaRDI QIDQ1182099
Publication date: 27 June 1992
Published in: Information Processing Letters (Search for Journal in Brave)
Related Items
Cites Work
- A note on adaptive parallel sorting
- Sorting roughly sorted sequences in parallel
- Sorting in \(c \log n\) parallel steps
- Encroaching lists as a measure of presortedness
- Smoothsort, an alternative for sorting in situ
- A new measure of presortedness
- Measures of Presortedness and Optimal Sorting Algorithms
- Exploiting partial order with Quicksort
- Parallel Merge Sort
- Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
- Parallel Prefix Computation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item