An optimal parallel adaptive sorting algorithm

DOI10.1016/0020-0190(91)90179-LzbMath0735.68020OpenAlexW2046620547MaRDI QIDQ1182099

Jingsen Chen, Svante Carlsson

Publication date: 27 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90179-l

zbMATH Keywords

EREW PRAMsorting presorted sequences

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15)

Related Items (1)

Exploiting few inversions when sorting: Sequential and parallel algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: An optimal parallel adaptive sorting algorithm