Recommendations
- Optimal binary search trees
- Optimal binary search trees
- A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees
- Optimal alphabetic binary tree for a nonregular cost function
- Algorithms – ESA 2005
- Optimal Computer Search Trees and Variable-Length Alphabetical Codes
- Binary search trees of almost optimal height
- Testing the optimality of alphabetic trees
- The optimal binary search tree for Andersson's search algorithm
- The Optimal Alphabetic Tree Problem Revisited
Cites work
Cited in
(12)- Binary Search on a Tape
- Optimal binary search trees
- On the cost of unsuccessful searches in search trees with two-way comparisons
- Binary search trees of almost optimal height
- Upper and Lower Bounds on Constructing Alphabetic Binary Trees
- Thresholds and optimal binary comparison search trees
- scientific article; zbMATH DE number 2081096 (Why is no real title available?)
- The Optimal Alphabetic Tree problem revisited
- Optimized binary search and text retrieval
- Operations research applications of dichotomous search
- The optimal binary search tree for Andersson's search algorithm
- Optimal search trees using two-way key comparisons
This page was built for publication: Optimal alphabetic trees for binary search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293336)
