A note on adaptive parallel sorting
From MaRDI portal
Publication:582114
DOI10.1016/0020-0190(89)90139-7zbMath0689.68086OpenAlexW2015193389MaRDI QIDQ582114
Christos Levcopoulos, Ola Petersson
Publication date: 1989
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(89)90139-7
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Exploiting few inversions when sorting: Sequential and parallel algorithms ⋮ An optimal parallel adaptive sorting algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sorting in \(c \log n\) parallel steps
- Encroaching lists as a measure of presortedness
- Some beautiful arguments using mathematical induction
- Smoothsort, an alternative for sorting in situ
- On computing the length of longest increasing subsequences
- A new measure of presortedness
- Measures of Presortedness and Optimal Sorting Algorithms
- Parallel Merge Sort
- Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
- Parallel Prefix Computation
This page was built for publication: A note on adaptive parallel sorting
