The following pages link to Optimal binary search trees (Q5906917):
Displaying 22 items.
- Optimal alphabetic trees for binary search (Q293336) (← links)
- Binary search trees of almost optimal height (Q911247) (← links)
- Efficient selection on a binary tree (Q1108019) (← links)
- Optimal binary trees with order constraints (Q1283811) (← links)
- The optimal binary search tree for Andersson's search algorithm (Q1323348) (← links)
- Efficient multiway radix search trees (Q1350102) (← links)
- Optimal binary search trees with costs depending on the access paths. (Q1401195) (← links)
- Operations research applications of dichotomous search (Q1681128) (← links)
- Minimax trees in linear time with applications (Q1761500) (← links)
- A new genetic approach to construct near-optimal binary search trees (Q2383896) (← links)
- Optimal Search Trees with 2-Way Comparisons (Q3459851) (← links)
- The Expected Performance of Traversal Algorithms in Binary Trees (Q3685212) (← links)
- (Q4524567) (← links)
- (Q4698688) (← links)
- (Q5009630) (← links)
- Binary search trees: How low can you go? (Q5054833) (← links)
- Multi-Finger Binary Search Trees (Q5091047) (← links)
- Building Optimal Binary Search Trees from Sorted Values in O(N) Time (Q5390280) (← links)
- (Q5443270) (← links)
- The Optimization of Signed Trees (Q5869439) (← links)
- Optimal binary search trees (Q5903763) (← links)
- Allocating the fixed cost as a complementary input in two-stage system: a DEA approach (Q6658865) (← links)