@InProceedings{golin_et_al:LIPIcs.ESA.2018.38,
author = {Golin, Mordecai and Iacono, John and Langerman, Stefan and Munro, J. Ian and Nekrich, Yakov},
title = {{Dynamic Trees with Almost-Optimal Access Cost}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {38:1--38:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.38},
URN = {urn:nbn:de:0030-drops-95017},
doi = {10.4230/LIPIcs.ESA.2018.38},
annote = {Keywords: Data Structures, Binary Search Trees, Adaptive Alphabetic Coding}
}