Layered working-set trees
From MaRDI portal
Publication:2429341
DOI10.1007/s00453-011-9542-1zbMath1241.68057arXiv0907.2071OpenAlexW1725687346MaRDI QIDQ2429341
Karim Douïeb, John Howat, Prosenjit Bose, Vida Dujmović
Publication date: 26 April 2012
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0907.2071
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A unified access bound on comparison-based dynamic dictionaries
- Symmetric binary B-trees: Data structure and maintenance algorithms
- Skip-Splay: Toward Achieving the Unified Bound in the BST Model
- Self-adjusting binary search trees
- Lower Bounds for Accessing Binary Search Trees with Rotations
- 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