The following pages link to (Q5443270):
Displaying 9 items.
- The power and limitations of static binary search trees with lazy finger (Q727988) (← links)
- Revisiting dynamic programming for finding optimal subtrees in trees (Q856203) (← links)
- Almost optimal dynamic 2-3 trees (Q1084868) (← links)
- Efficient selection on a binary tree (Q1108019) (← links)
- The optimal binary search tree for Andersson's search algorithm (Q1323348) (← links)
- Static optimality and dynamic search-optimality in lists and trees (Q1400896) (← links)
- Arboral satisfaction: recognition and LP approximation (Q2398493) (← links)
- A study on splay trees (Q2419117) (← links)
- On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations (Q5199262) (← links)