Thresholds and optimal binary comparison search trees

DOI10.1016/S0196-6774(02)00203-1MaRDI QIDQ4805400zbMATH OpenOpenAlexFDO

Authors

Publication date 14 May 2003

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

Full work available at URL https://doi.org/10.1016/s0196-6774(02)00203-1

zbMATH Keywords

split tree algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 2081096
• Optimal Search Trees with 2-Way Comparisons
• Optimal search trees using two-way key comparisons
• Optimal alphabetic trees for binary search
• The optimal binary search tree for Andersson's search algorithm

Cited in

(10)

• 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
• Performance optimization of object comparison
• scientific article; zbMATH DE number 2081096 (Why is no real title available?)
• A Simple Algorithm for Optimal Search Trees with Two-way Comparisons
• 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: Thresholds and optimal binary comparison search trees

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