@InProceedings{kraus_et_al:LIPIcs.CPM.2023.19,
author = {Kraus, Matan and Lewenstein, Moshe and Popa, Alexandru and Porat, Ely and Sadia, Yonathan},
title = {{String Factorization via Prefix Free Families}},
booktitle = {34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023)},
pages = {19:1--19:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-276-1},
ISSN = {1868-8969},
year = {2023},
volume = {259},
editor = {Bulteau, Laurent and Lipt\'{a}k, Zsuzsanna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2023.19},
URN = {urn:nbn:de:0030-drops-179738},
doi = {10.4230/LIPIcs.CPM.2023.19},
annote = {Keywords: string factorization, NP-hard problem, approximation algorithm}
}