Optimum split trees

DOI10.1016/0196-6774(84)90017-8MaRDI QIDQ3336707zbMATH OpenOpenAlexFDO

Authors Yehoshua Perl

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)90017-8

zbMATH Keywords

binary search treedynamic programming procedurepolynomial algorithmsplit treetop down decisions

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Faster construction of optimal binary split trees
• Optimal binary split trees
• Construction of optimal binary split trees in the presence of bounded access probabilities
• Optimal multiway split trees
• Optimal binary search trees

Cited in

(12)

• 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
• Optimal binary split trees
• Faster construction of optimal binary split trees
• Construction of optimal binary split trees in the presence of bounded access probabilities
• Optimal multiway split trees
• Optimal multiway generalized split trees
• Lazy tree splitting
• Classification via two-way comparisons (extended abstract)
• Classification via two-way comparisons
• A note on optimal multiway split trees

This page was built for publication: Optimum split trees

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