@InProceedings{chalermsook_et_al:LIPIcs.ISAAC.2018.55,
author = {Chalermsook, Parinya and Goswami, Mayank and Kozma, L\'{a}szl\'{o} and Mehlhorn, Kurt and Saranurak, Thatchaphol},
title = {{Multi-Finger Binary Search Trees}},
booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)},
pages = {55:1--55:26},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-094-1},
ISSN = {1868-8969},
year = {2018},
volume = {123},
editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.55},
URN = {urn:nbn:de:0030-drops-100032},
doi = {10.4230/LIPIcs.ISAAC.2018.55},
annote = {Keywords: binary search trees, dynamic optimality, finger search, k-server}
}