Faster construction of optimal binary split trees

DOI10.1016/0196-6774(86)90031-3MaRDI QIDQ3777468zbMATH OpenOpenAlexFDO

Authors

Publication date 1986

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

Full work available at URL https://doi.org/10.1016/0196-6774(86)90031-3

zbMATH Keywords

binary searchbinary split treedynamic programmingheapssearch

Mathematics Subject Classification ID

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

Recommendations

• Construction of optimal binary split trees in the presence of bounded access probabilities
• Optimum split trees
• Optimal binary split trees
• Generalized binary split trees
• Optimal binary search trees

Cited in

(18)

• Ordered priority queues
• 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
• How to speed up the quantization tree algorithm with an application to swing options
• Optimal binary split trees
• Optimum split trees
• Construction of optimal binary split trees in the presence of bounded access probabilities
• Optimal multiway split trees
• Optimal multiway generalized split trees
• scientific article; zbMATH DE number 1524355 (Why is no real title available?)
• Obtaining Optimalk-Cardinality Trees Fast
• 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
• On the construction of weighted time-optimal B-trees

This page was built for publication: Faster construction of optimal binary split trees

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