Valentin Blomer, Kai-Uwe Bux. k-u-bux/rotate-paper (Software, Source Code). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@misc{dagstuhl-artifact-26939,
title = {{k-u-bux/rotate-paper}},
author = {Blomer, Valentin and Bux, Kai-Uwe},
note = {Software, swhId: \href{https://archive.softwareheritage.org/swh:1:dir:43dec7a1575086c46591763350f18f0aa6cb7af5;origin=https://github.com/k-u-bux/rotate-paper;visit=swh:1:snp:a1345dbe8702b2ce5d83e6a0554b9268aa18d937;anchor=swh:1:rev:575c9a000c089a6e42fe1e3a0dd5a761cf48201d}{\texttt{swh:1:dir:43dec7a1575086c46591763350f18f0aa6cb7af5}} (visited on 2026-07-13)},
url = {https://github.com/k-u-bux/rotate-paper},
doi = {10.4230/artifacts.26939},
}
Published in: LIPIcs, Volume 381, 37th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2026)
Valentin Blomer and Kai-Uwe Bux. The Cost of Cyclic Permutations and Remainder Sums in the Euclidean Algorithm. In 37th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 381, pp. 14:1-14:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{blomer_et_al:LIPIcs.AofA.2026.14,
author = {Blomer, Valentin and Bux, Kai-Uwe},
title = {{The Cost of Cyclic Permutations and Remainder Sums in the Euclidean Algorithm}},
booktitle = {37th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2026)},
pages = {14:1--14:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-435-2},
ISSN = {1868-8969},
year = {2026},
volume = {381},
editor = {Panagiotou, Konstantinos},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2026.14},
URN = {urn:nbn:de:0030-drops-262858},
doi = {10.4230/LIPIcs.AofA.2026.14},
annote = {Keywords: generic algorithms, average case analysis, Euclidean algorithm, exponential sums, cyclic permutations}
}