Pages that link to "Item:Q3795240"
From MaRDI portal
The following pages link to A subquadratic algorithm for constructing approximately optimal binary search trees (Q3795240):
Displaying 11 items.
- Assembling approximately optimal binary search trees efficiently using arithmetics (Q989540) (← links)
- Restructuring binary search trees revisited (Q1041801) (← links)
- Optimal binary search trees with costs depending on the access paths. (Q1401195) (← links)
- Operations research applications of dichotomous search (Q1681128) (← links)
- A strategy for searching with different access costs. (Q1853499) (← links)
- A new genetic approach to construct near-optimal binary search trees (Q2383896) (← links)
- Practical approximation algorithms for zero- and bounded-skew trees (Q2768326) (← links)
- An Analysis of a Good Algorithm for the Subtree Problem, Corrected (Q3833624) (← links)
- (Q4698688) (← links)
- Optimal binary search trees (Q5906917) (← links)
- Optimum alphabetic binary trees (Q6567684) (← links)