Pages that link to "Item:Q293336"
From MaRDI portal
The following pages link to Optimal alphabetic trees for binary search (Q293336):
Displaying 9 items.
- Binary search trees of almost optimal height (Q911247) (← links)
- The optimal binary search tree for Andersson's search algorithm (Q1323348) (← links)
- Optimal search trees using two-way key comparisons (Q1342505) (← links)
- Operations research applications of dichotomous search (Q1681128) (← links)
- On the cost of unsuccessful searches in search trees with two-way comparisons (Q2051772) (← links)
- The Optimal Alphabetic Tree problem revisited (Q4632431) (← links)
- Upper and Lower Bounds on Constructing Alphabetic Binary Trees (Q4863980) (← links)
- Optimal binary search trees (Q5903763) (← links)
- Optimized binary search and text retrieval (Q6102310) (← links)