On Huang and Wong's algorithm for generalized binary split trees

DOI10.1007/S00236-021-00411-ZMaRDI QIDQ2089746zbMATH OpenOpenAlexFDO

Authors Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young

Publication date 24 October 2022

Published in Acta Informatica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1901.03783

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Generalized binary split trees
• Faster construction of optimal binary split trees
• A note on optimal multiway split trees
• Construction of optimal binary split trees in the presence of bounded access probabilities
• Optimal binary split trees
• A parallel algorithm for bisection width in trees
• Approximation strategies for generalized binary search in weighted trees
• Optimal multiway generalized split trees
• On Exact Algorithms for Treewidth
• scientific article; zbMATH DE number 4062608

Cites work

• A Simple Algorithm for Optimal Search Trees with Two-way Comparisons
• Faster construction of optimal binary split trees
• Generalized binary split trees
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• Median split trees
• On the cost of unsuccessful searches in search trees with two-way comparisons
• Optimal binary split trees
• Optimal multiway generalized split trees
• Optimal search trees using two-way key comparisons
• Optimal Search Trees with 2-Way Comparisons
• Optimum binary search trees
• Optimum split trees
• Thresholds and optimal binary comparison search trees

Cited in

(4)

• Classification via two-way comparisons (extended abstract)
• A tight threshold bound for search trees with 2-way comparisons
• A tight threshold bound for search trees with 2-way comparisons
• Classification via two-way comparisons

This page was built for publication: On Huang and Wong's algorithm for generalized binary split trees

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