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.
@article{arxiv.1511.03148,
title = {A Study on Splay Trees},
author = {Luís M. S. Russo},
journal= {arXiv preprint arXiv:1511.03148},
year = {2020}
}
Comments
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