@inproceedings{3cc41659369d4e0dbedd5982928b2fee,
title = "Covers in Optimal Space",
abstract = "A cover of a string S is a string C such that every index of S is contained in some occurrence of C. First introduced by Apostolico and Ehrenfeucht [TCS{\textquoteright}93] over 30 years ago, covers have since received significant attention in the string algorithms community. In this work, we present a space-efficient algorithm for computing a compact representation of all covers of a given string. Our algorithm requires only O(log n) additional memory while accessing the input string of length n in a read-only manner. Moreover, it runs in O(n) time, matching the best-known time complexity for this problem while achieving an exponential improvement in space usage.",
keywords = "Cover, Read-only random access, small space",
author = "Itai Boneh and Shay Golan",
note = "Publisher Copyright: {\textcopyright} Itai Boneh and Shay Golan;; 36th Annual Symposium on Combinatorial Pattern Matching, CPM 2025 ; Conference date: 17-06-2025 Through 19-06-2025",
year = "2025",
month = jun,
day = "10",
doi = "10.4230/LIPIcs.CPM.2025.5",
language = "אנגלית",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Paola Bonizzoni and Veli Makinen",
booktitle = "36th Annual Symposium on Combinatorial Pattern Matching, CPM 2025",
address = "גרמניה",
}