A parallel algorithm for optimum height-limited alphabetic binary trees

DOI10.1006/jpdc.1996.0067zbMath0855.68036OpenAlexW2023417651MaRDI QIDQ1923383

Teresa M. Przytycka, Lawrence L. Larmore

Publication date: 25 November 1996

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.1996.0067

zbMATH Keywords

optimal alphabetic binary treeparallel package merge

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items (3)

Operations research applications of dichotomous search ⋮ The Optimal Alphabetic Tree problem revisited ⋮ Optimal binary search trees

This page was built for publication: A parallel algorithm for optimum height-limited alphabetic binary trees