Merging and sorting strings in parallel

DOI10.1007/3-540-55808-X_28MaRDI QIDQ5096841zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Optimal parallel string algorithms: sorting, merging and computing the minimum
• Sorting strings and constructing digital search trees in parallel
• Fast integer merging on the EREW PRAM
• Space-efficient parallel merging
• On parallel integer merging

Cites work

• Finding the maximum, merging, and sorting in a parallel computation model
• scientific article; zbMATH DE number 3817043 (Why is no real title available?)
• Improved deterministic parallel integer sorting
• Optimal merging and sorting on the EREW PRAM
• Searching, Merging, and Sorting in Parallel Computation

Cited in

(5)

• An efficient parallel algorithm for the single function coarsest partition problem
• Sorting strings and constructing digital search trees in parallel
• Optimal parallel string algorithms: sorting, merging and computing the minimum
• On demand string sorting over unbounded alphabets
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096841)