Multi-finger binary search trees

Parinya Chalermsook; Mayank Goswami; László Kozma; Kurt Mehlhorn; Thatchaphol Saranurak

doi:10.4230/LIPIcs.ISAAC.2018.55

Multi-finger binary search trees

Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussa › Conference contribution › Scientific › vertaisarvioitu

38 Lataukset (Pure)

Alkuperäiskieli	Englanti
Otsikko	29th International Symposium on Algorithms and Computation (ISAAC 2018)
Kustantaja	Schloss Dagstuhl-Leibniz-Zentrum für Informatik
Sivut	1-26
ISBN (painettu)	978-3-95977-094-1
DOI - pysyväislinkit	https://doi.org/10.4230/LIPIcs.ISAAC.2018.55
Tila	Julkaistu - 2018
OKM-julkaisutyyppi	A4 Artikkeli konferenssijulkaisuussa
Tapahtuma	International Symposium on Algorithms and Computation - Jiaoxi, Taiwan Kesto: 16 jouluk. 2018 → 19 jouluk. 2018 Konferenssinumero: 29

Julkaisusarja

Nimi	Leibniz International Proceedings in Informatics (LIPIcs)
ISSN (elektroninen)	1868-8969

Conference

Conference	International Symposium on Algorithms and Computation
Lyhennettä	ISAAC
Maa/Alue	Taiwan
Kaupunki	Jiaoxi
Ajanjakso	16/12/2018 → 19/12/2018

Pääsy asiakirjaan

10.4230/LIPIcs.ISAAC.2018.55

LIPIcs-ISAAC-2018-55Final published version, 626 KBLisenssi: CC BY

http://arxiv.org/abs/1809.01759

OpenUrl-saatavuus

Koko teksti

Siteeraa tätä

@inproceedings{fde40c3c0cdf4ef4804d641b52a4c28c,

title = "Multi-finger binary search trees",

author = "Parinya Chalermsook and Mayank Goswami and L{\'a}szl{\'o} Kozma and Kurt Mehlhorn and Thatchaphol Saranurak",

year = "2018",

doi = "10.4230/LIPIcs.ISAAC.2018.55",

language = "English",

isbn = "978-3-95977-094-1",

series = "Leibniz International Proceedings in Informatics (LIPIcs)",

publisher = "Schloss Dagstuhl-Leibniz-Zentrum f{\"u}r Informatik",

pages = "1--26",

booktitle = "29th International Symposium on Algorithms and Computation (ISAAC 2018)",

address = "Germany",

note = "International Symposium on Algorithms and Computation, ISAAC ; Conference date: 16-12-2018 Through 19-12-2018",

}

Chalermsook, P, Goswami, M, Kozma, L, Mehlhorn, K & Saranurak, T 2018, Multi-finger binary search trees. julkaisussa 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Sivut 1-26, International Symposium on Algorithms and Computation, Jiaoxi, Taiwan, 16/12/2018. https://doi.org/10.4230/LIPIcs.ISAAC.2018.55

Multi-finger binary search trees. / Chalermsook, Parinya; Goswami, Mayank; Kozma, László et al.

29th International Symposium on Algorithms and Computation (ISAAC 2018). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2018. s. 1-26 (Leibniz International Proceedings in Informatics (LIPIcs)).

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussa › Conference contribution › Scientific › vertaisarvioitu

TY - GEN

T1 - Multi-finger binary search trees

AU - Chalermsook, Parinya

AU - Goswami, Mayank

AU - Kozma, László

AU - Mehlhorn, Kurt

AU - Saranurak, Thatchaphol

N1 - Conference code: 29

PY - 2018

Y1 - 2018

U2 - 10.4230/LIPIcs.ISAAC.2018.55

DO - 10.4230/LIPIcs.ISAAC.2018.55

M3 - Conference contribution

SN - 978-3-95977-094-1

T3 - Leibniz International Proceedings in Informatics (LIPIcs)

SP - 1

EP - 26

BT - 29th International Symposium on Algorithms and Computation (ISAAC 2018)

PB - Schloss Dagstuhl-Leibniz-Zentrum für Informatik

T2 - International Symposium on Algorithms and Computation

Y2 - 16 December 2018 through 19 December 2018

ER -