A Study on Splay Trees
Abstract
We study the dynamic optimality conjecture, which predicts that splay trees are a form of universally efficient binary search tree, for any access sequence. We reduce this claim to a regular access bound, which seems plausible and might be easier to prove. This approach may be useful to establish dynamic optimality.
- Publication:
-
arXiv e-prints
- Pub Date:
- November 2015
- DOI:
- 10.48550/arXiv.1511.03148
- arXiv:
- arXiv:1511.03148
- Bibcode:
- 2015arXiv151103148R
- Keywords:
-
- Computer Science - Data Structures and Algorithms;
- 68P05;
- 68P10;
- 05C05;
- 94A17;
- 68Q25;
- 68P20;
- 68W27;
- 68W40;
- 68Q25;
- E.1
- E-Print:
- This research has received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Actions H2020-MSCA-RISE-2015 BIRDS GA No. 690941