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

DOI10.1016/0196-6774(88)90040-5MaRDI QIDQ3777470zbMATH OpenOpenAlexFDO

Authors J. H. Hester, Lawrence L. Larmore, 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

access probabilitybinary split treeefficiency of algorithmssearch

Mathematics Subject Classification ID

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

Recommendations

• Faster construction of optimal binary split trees
• Optimum split trees
• Optimal binary split trees
• Generalized binary split trees
• A note on optimal multiway split trees

Cited in

(11)

• On Huang and Wong's algorithm for generalized binary split trees
• Optimal binary split trees
• Optimum split trees
• Faster construction of optimal binary split trees
• scientific article; zbMATH DE number 4064505 (Why is no real title available?)
• scientific article; zbMATH DE number 1524355 (Why is no real title available?)
• Optimal binary search trees
• Generalized binary split trees
• A note on optimal multiway split trees
• On the construction of weighted time-optimal B-trees
• Assembling approximately optimal binary search trees efficiently using arithmetics

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

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