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

DOI10.1007/s00236-021-00411-zOpenAlexW4213086851MaRDI QIDQ2089746

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

Publication date: 24 October 2022

Published in: Acta Informatica (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Classification via two-way comparisons (extended abstract)

Cites Work

• Unnamed Item
• Generalized binary split trees
• Optimal search trees using two-way key comparisons
• On the cost of unsuccessful searches in search trees with two-way comparisons
• Optimum binary search trees
• Optimal binary split trees
• Optimum split trees
• Optimal Search Trees with 2-Way Comparisons
• Faster construction of optimal binary split trees
• Optimal multiway generalized split trees
• Median split trees
• Thresholds and optimal binary comparison search trees
• A Simple Algorithm for Optimal Search Trees with Two-way Comparisons

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