The group access bounds for binary search trees
From MaRDI portal
Cites work
- O(log log n)-competitive dynamic binary search trees
- A unified access bound on comparison-based dynamic dictionaries
- Alternatives to splay trees with O( n) worst-case access times
- An \(O(\log \log n)\)-competitive binary search tree with optimal worst-case access times
- Better analysis of binary search tree on decomposable sequences
- Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying
- Combining binary search trees
- Dynamic Optimality—Almost
- Fusible HSTs and the randomized k-server conjecture
- Greedy is an almost optimal deque
- scientific article; zbMATH DE number 1670671 (Why is no real title available?)
- scientific article; zbMATH DE number 7651167 (Why is no real title available?)
- Improved pattern-avoidance bounds for Greedy BSTs via matrix decomposition
- Key-independent optimality
- Layered working-set trees
- Lower Bounds for Accessing Binary Search Trees with Rotations
- On the k -server conjecture
- On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
- On the hierarchy of distribution-sensitive properties for data structures
- Pattern-avoiding access in binary search trees
- Self-adjusting binary search trees
- Self-adjusting binary search trees: what makes them tick?
- Sequential access in splay trees takes linear time
- Skip-Splay: Toward Achieving the Unified Bound in the BST Model
- Smooth heaps and a dual view of self-adjusting data structures
- Sorting pattern-avoiding permutations via 0-1 matrices forbidding product patterns
- The geometry of binary search trees
- Upper bounds for maximally greedy binary search trees
- Weighted dynamic finger in binary search trees
This page was built for publication: The group access bounds for binary search trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875167)
