@InProceedings{kosolobov_et_al:LIPIcs.CPM.2024.20,
author = {Kosolobov, Dmitry and Sivukhin, Nikita},
title = {{Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space}},
booktitle = {35th Annual Symposium on Combinatorial Pattern Matching (CPM 2024)},
pages = {20:1--20:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-326-3},
ISSN = {1868-8969},
year = {2024},
volume = {296},
editor = {Inenaga, Shunsuke and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2024.20},
URN = {urn:nbn:de:0030-drops-201309},
doi = {10.4230/LIPIcs.CPM.2024.20},
annote = {Keywords: (\tau,\delta)-partitioning set, longest common extension, sparse suffix tree}
}