Sorting roughly sorted sequences in parallel

DOI10.1016/0020-0190(90)90212-GzbMath0694.68026OpenAlexW1963742442MaRDI QIDQ909454

Tom Altman, Bogdan S. Chlebus

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90212-g

zbMATH Keywords

sortinganalysis of algorithmsparallel algorithmsCRCW PRAM

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (3)

Exploiting few inversions when sorting: Sequential and parallel algorithms ⋮ Computing and ranking measures of presortedness ⋮ An optimal parallel adaptive sorting algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sorting in \(c \log n\) parallel steps
• Routing, merging, and sorting on parallel models of computation
• A new measure of presortedness
• Measures of Presortedness and Optimal Sorting Algorithms
• Parallel Merge Sort
• Tight Comparison Bounds on the Complexity of Parallel Sorting
• Parallel Prefix Computation

This page was built for publication: Sorting roughly sorted sequences in parallel