Pages that link to "Item:Q4136557"
From MaRDI portal
The following pages link to A Best Possible Bound for The Weighted Path Length of Binary Search Trees (Q4136557):
Displaying 20 items.
- Tight bounds for online stable sorting (Q553955) (← links)
- Assembling approximately optimal binary search trees efficiently using arithmetics (Q989540) (← links)
- Compressed depth sequences (Q1006078) (← links)
- Restructuring binary search trees revisited (Q1041801) (← links)
- Compressing probability distributions (Q1045918) (← links)
- Optimum multiway search trees (Q1138383) (← links)
- Binary search trees in secondary memory (Q1146005) (← links)
- Greedy binary search trees are nearly optimal (Q1163867) (← links)
- New lower bounds on the cost of binary search trees (Q1351808) (← links)
- Operations research applications of dichotomous search (Q1681128) (← links)
- On binary search trees (Q2366072) (← links)
- A new genetic approach to construct near-optimal binary search trees (Q2383896) (← links)
- Lower bounds for expected-case planar point location (Q2462734) (← links)
- A History of Distribution-Sensitive Data Structures (Q2848972) (← links)
- Efficient Construction of Near-Optimal Binary and Multiway Search Trees (Q3183458) (← links)
- Reflections on Optimal and Nearly Optimal Binary Search Trees (Q3644717) (← links)
- Dynamic Trees with Almost-Optimal Access Cost (Q5009598) (← links)
- (Q5009630) (← links)
- Optimal binary search trees (Q5906917) (← links)
- Competitive Online Search Trees on Trees (Q6051990) (← links)