The Average Complexity of Parallel Comparison Merging

DOI10.1137/0221004zbMATH Open0743.68050OpenAlexW2064537947MaRDI QIDQ3990098

Mihály Geréb-Graus, Danny 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)

Related Items (2)

Unnamed Item ⋮ Unnamed Item

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