A Binary Search Tree with the Unified Bound
cs.DS
Submitted: 2026-11-12
Updated: 2026-11-12
Terminology
Sources
- The landscape of bounds for binary search trees
- Splay trees are almost dynamically optimal
- Stanley-Wilf limits are typically exponential
- The Greedy Binary Search Tree is Non-trivially Competitive
- The Fresh-Finger Property
- Sorting under Partial Information with Optimal Preprocessing Time via Unified Bound Heaps
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time