Merging and sorting strings in parallel

DOI10.1007/3-540-55808-X_28zbMath1493.68409OpenAlexW1508623823MaRDI QIDQ5096841

Torben Hagerup, Ola Petersson

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1992 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55808-x_28

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)

Related Items (3)

An efficient parallel algorithm for the single function coarsest partition problem ⋮ Sorting strings and constructing digital search trees in parallel ⋮ On demand string sorting over unbounded alphabets

Cites Work

• Optimal merging and sorting on the EREW PRAM
• Improved deterministic parallel integer sorting
• Searching, Merging, and Sorting in Parallel Computation
• Finding the maximum, merging, and sorting in a parallel computation model
• Unnamed Item

This page was built for publication: Merging and sorting strings in parallel