Construction of optimal binary split trees in the presence of bounded access probabilities

DOI10.1016/0196-6774(88)90040-5zbMath0637.68071OpenAlexW2041182800MaRDI QIDQ3777470

Lawrence L. Larmore, J. H. Hester, Daniel S. Hirschberg

Publication date: 1988

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(88)90040-5

zbMATH Keywords

searchefficiency of algorithmsbinary split treeaccess probability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (1)

Optimal binary search trees

This page was built for publication: Construction of optimal binary split trees in the presence of bounded access probabilities