Pages that link to "Item:Q1351808"
From MaRDI portal
The following pages link to New lower bounds on the cost of binary search trees (Q1351808):
Displaying 8 items.
- The cost of offline binary search tree algorithms and the complexity of the request sequence (Q2481968) (← links)
- Practical approximation algorithms for zero- and bounded-skew trees (Q2768326) (← links)
- Efficient Construction of Near-Optimal Binary and Multiway Search Trees (Q3183458) (← links)
- An Improved Bound for Random Binary Search Trees with Concurrent Insertions (Q3304136) (← links)
- Reflections on Optimal and Nearly Optimal Binary Search Trees (Q3644717) (← links)
- Lower Bounds for Accessing Binary Search Trees with Rotations (Q3829056) (← links)
- Binary search trees: How low can you go? (Q5054833) (← links)
- Optimal binary search trees (Q5906917) (← links)