Perfectly overlapped merging and sorting on a two-way linear array

DOI10.1016/S0020-0190(96)00157-3zbMath0900.68177OpenAlexW1981007126MaRDI QIDQ673341

Yen-Chun Lin

Publication date: 28 February 1997

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(96)00157-3

zbMATH Keywords

Parallel algorithmsSortingMerging

Mathematics Subject Classification ID

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

Cites Work

• Optimal parallel algorithms for computing convex hulls and for sorting
• Merging sorted runs using large main memory
• Space and time complexities of balanced sorting on processor arrays
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Perfectly overlapped merging and sorting on a two-way linear array