The Average Complexity of Parallel Comparison Merging

DOI10.1137/0221004MaRDI QIDQ3990098zbMATH OpenOpenAlexFDO

Authors Mihály Geréb-Graus, D. Krizanc

Publication date 28 June 1992

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0221004

zbMATH Keywords

average case complexitymergingparallel comparison tree

Mathematics Subject Classification ID

Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Parallel comparison merging of many-ordered lists
• The average-case parallel complexity of sorting
• The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms
• Optimal parallel merging and sorting algorithms using \(\sqrt{N}\) processors without memory contention
• scientific article; zbMATH DE number 3949727

Cited in

(3)

• Average merge time: an intuitive interpretation
• scientific article; zbMATH DE number 3990870 (Why is no real title available?)
• Parallel comparison merging of many-ordered lists

This page was built for publication: The Average Complexity of Parallel Comparison Merging

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