Feedback on the Current Page
Published in: LIPIcs, Volume 351, 33rd Annual European Symposium on Algorithms (ESA 2025)
Mateusz Basiak, Marcin Bienkowski, Martin Böhm, Marek Chrobak, Łukasz Jeż, Jiří Sgall, and Agnieszka Tatarczuk. A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs. In 33rd Annual European Symposium on Algorithms (ESA 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 351, pp. 76:1-76:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{basiak_et_al:LIPIcs.ESA.2025.76,
author = {Basiak, Mateusz and Bienkowski, Marcin and B\"{o}hm, Martin and Chrobak, Marek and Je\.{z}, {\L}ukasz and Sgall, Ji\v{r}{\'\i} and Tatarczuk, Agnieszka},
title = {{A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs}},
booktitle = {33rd Annual European Symposium on Algorithms (ESA 2025)},
pages = {76:1--76:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-395-9},
ISSN = {1868-8969},
year = {2025},
volume = {351},
editor = {Benoit, Anne and Kaplan, Haim and Wild, Sebastian 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.2025.76},
URN = {urn:nbn:de:0030-drops-245442},
doi = {10.4230/LIPIcs.ESA.2025.76},
annote = {Keywords: List update, work functions, amortized analysis, online algorithms, competitive analysis}
}