Parallel merging with restriction

DOI10.1007/s11227-007-0141-5zbMath1317.68260OpenAlexW1968532465MaRDI QIDQ1009355

Hazem M. Bahig

Publication date: 31 March 2009

Published in: The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11227-007-0141-5

zbMATH Keywords

parallel algorithmsoptimal algorithmsEREW PRAMinteger merging

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal merging and sorting on the EREW PRAM
• On parallel integer merging
• Recognizing and representing proper interval graphs in parallel using merging and sorting
• A complexity theory of efficient parallel algorithms
• Routing, merging, and sorting on parallel models of computation
• An optimal parallel algorithm for merging using multiselection
• Fast integer merging on the EREW PRAM
• Searching, Merging, and Sorting in Parallel Computation
• Finding the maximum, merging, and sorting in a parallel computation model
• Merging on the BSP model