Go to the corresponding LIPIcs Volume Portal 
Golin, Mordecai ; Iacono, John ; Langerman, Stefan ; Munro, J. Ian ; Nekrich, Yakov
pdfformat: 

@InProceedings{golin_et_al:LIPIcs:2018:9501, author = {Mordecai Golin and John Iacono and Stefan Langerman and J. Ian Munro and Yakov Nekrich}, title = {{Dynamic Trees with AlmostOptimal Access Cost}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, pages = {38:138:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770811}, ISSN = {18688969}, year = {2018}, volume = {112}, editor = {Yossi Azar and Hannah Bast and Grzegorz Herman}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9501}, URN = {urn:nbn:de:0030drops95017}, doi = {10.4230/LIPIcs.ESA.2018.38}, annote = {Keywords: Data Structures, Binary Search Trees, Adaptive Alphabetic Coding} }
Keywords:  Data Structures, Binary Search Trees, Adaptive Alphabetic Coding  
Seminar:  26th Annual European Symposium on Algorithms (ESA 2018)  
Issue Date:  2018  
Date of publication:  08.08.2018 