@InProceedings{ischebeck_et_al:LIPIcs.AofA.2024.9,
author = {Ischebeck, Jasper and Neininger, Ralph},
title = {{On Fluctuations of Complexity Measures for the FIND Algorithm}},
booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)},
pages = {9:1--9:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-329-4},
ISSN = {1868-8969},
year = {2024},
volume = {302},
editor = {Mailler, C\'{e}cile and Wild, Sebastian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2024.9},
URN = {urn:nbn:de:0030-drops-204440},
doi = {10.4230/LIPIcs.AofA.2024.9},
annote = {Keywords: FIND, Quickselect, rank selection, probabilistic analysis of algorithms, weak convergence, functional limit theorem}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode