Randomized splay trees: Theoretical and experimental results.
From MaRDI portal
Publication:1603506
DOI10.1016/S0020-0190(01)00230-7zbMath1052.68021WikidataQ56066200 ScholiaQ56066200MaRDI QIDQ1603506
Susanne Albers, Marek Karpinski
Publication date: 14 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00230-7
Cites Work
- Sequential access in splay trees takes linear time
- Splaying a search tree in preorder takes linear time
- Self-adjusting binary search trees
- On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences
- An Explanation of Splaying
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item