Multi-Finger Binary Search Trees
From MaRDI portal
Recommendations
- Weighted dynamic finger in binary search trees
- scientific article; zbMATH DE number 19204
- Efficient multiway radix search trees
- scientific article; zbMATH DE number 2079361
- Publication:3468604
- On binary search trees
- Finger trees: a simple general-purpose data structure
- Distances and Finger Search in Random Binary Search Trees
- Optimal binary search trees
Cites work
- A new data structure for representing sorted lists
- A polylogarithmic-competitive algorithm for the k-server problem
- A unified access bound on comparison-based dynamic dictionaries
- Algorithms and Data Structures
- Alternatives to splay trees with O( n) worst-case access times
- An Optimal On-Line Algorithm for K Servers on Trees
- Asymptotic values for degrees associated with strips of Young diagrams
- Combining binary search trees
- Competitive k-server algorithms
- Competitive algorithms for server problems
- Confluently persistent tries for efficient version control
- Design and Analysis of a Data Structure for Representing Sorted Lists
- Efficient algorithms for online decision problems
- scientific article; zbMATH DE number 1670671 (Why is no real title available?)
- scientific article; zbMATH DE number 3887059 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 1256736 (Why is no real title available?)
- scientific article; zbMATH DE number 1033192 (Why is no real title available?)
- scientific article; zbMATH DE number 6876068 (Why is no real title available?)
- In pursuit of the dynamic optimality conjecture
- On the k -server conjecture
- On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences
- On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
- Pattern matching for permutations
- Randomized search trees
- Self-adjusting binary search trees: what makes them tick?
- Skip-Splay: Toward Achieving the Unified Bound in the BST Model
- Sorting shuffled monotone sequences
- Static optimality and dynamic search-optimality in lists and trees
- The \(k\)-server problem
- The geometry of binary search trees
- The harmonic k -server algorithm is competitive
- The multiplicative weights update method: a meta-algorithm and applications
- Weighted dynamic finger in binary search trees
Cited in
(3)
This page was built for publication: Multi-Finger Binary Search Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091047)
