Multi-finger binary search trees
Loading...
Access rights
openAccess
publishedVersion
URL
Journal Title
Journal ISSN
Volume Title
A4 Artikkeli konferenssijulkaisussa
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
Date
Department
Major/Subject
Mcode
Degree programme
Language
en
Pages
Series
29th International Symposium on Algorithms and Computation (ISAAC 2018), pp. 1-26, Leibniz International Proceedings in Informatics (LIPIcs)
Description
Keywords
Other note
Citation
Chalermsook, P, Goswami, M, Kozma, L, Mehlhorn, K & Saranurak, T 2018, Multi-finger binary search trees. in 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 1-26, International Symposium on Algorithms and Computation, Jiaoxi, Taiwan, Republic of China, 16/12/2018. https://doi.org/10.4230/LIPIcs.ISAAC.2018.55