R. Chaudhuri, Hartmut Höft. Splaying a search tree in preorder takes linear time. SIGACT News, 24(2):88-93, 1993. [doi]
@article{ChaudhuriH93,
title = {Splaying a search tree in preorder takes linear time},
author = {R. Chaudhuri and Hartmut Höft},
year = {1993},
doi = {10.1145/156063.156067},
url = {https://doi.org/10.1145/156063.156067},
researchr = {https://researchr.org/publication/ChaudhuriH93},
cites = {0},
citedby = {0},
journal = {SIGACT News},
volume = {24},
number = {2},
pages = {88-93},
}