@InProceedings{charalampopoulos_et_al:LIPIcs.CPM.2022.20,
author = {Charalampopoulos, Panagiotis and Pissis, Solon P. and Radoszewski, Jakub},
title = {{Longest Palindromic Substring in Sublinear Time}},
booktitle = {33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022)},
pages = {20:1--20:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-234-1},
ISSN = {1868-8969},
year = {2022},
volume = {223},
editor = {Bannai, Hideo and Holub, Jan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2022.20},
URN = {urn:nbn:de:0030-drops-161472},
doi = {10.4230/LIPIcs.CPM.2022.20},
annote = {Keywords: string algorithms, longest palindromic substring, longest common extension}
}