Optimal binary split trees

DOI10.1016/0196-6774(84)90041-5MaRDI QIDQ3321483zbMATH OpenOpenAlexFDO

Authors

Publication date 1984

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

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

zbMATH Keywords

algorithmoptimal representations of split treessuboptimal split trees

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Faster construction of optimal binary split trees
• Optimum split trees
• Generalized binary split trees
• Construction of optimal binary split trees in the presence of bounded access probabilities
• A note on optimal multiway split trees

Cited in

(14)

• Ordered priority queues
• Optimal binary trees with order constraints
• Optimal search trees using two-way key comparisons
• On the cost of unsuccessful searches in search trees with two-way comparisons
• On Huang and Wong's algorithm for generalized binary split trees
• Optimum split trees
• Faster construction of optimal binary split trees
• Construction of optimal binary split trees in the presence of bounded access probabilities
• Optimal multiway generalized split trees
• Optimal binary search trees
• Classification via two-way comparisons (extended abstract)
• Classification via two-way comparisons
• Generalized binary split trees
• A note on optimal multiway split trees

This page was built for publication: Optimal binary split trees

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