@InProceedings{ellert_et_al:LIPIcs.ICALP.2021.63,
author = {Ellert, Jonas and Fischer, Johannes},
title = {{Linear Time Runs Over General Ordered Alphabets}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {63:1--63:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.63},
URN = {urn:nbn:de:0030-drops-141322},
doi = {10.4230/LIPIcs.ICALP.2021.63},
annote = {Keywords: String algorithms, Lyndon array, runs, squares, longest common extension, general ordered alphabets, combinatorics on words}
}