@InProceedings{legall_et_al:LIPIcs.ITCS.2022.97,
author = {Le Gall, Fran\c{c}ois and Seddighin, Saeed},
title = {{Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {97:1--97:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.97},
URN = {urn:nbn:de:0030-drops-156934},
doi = {10.4230/LIPIcs.ITCS.2022.97},
annote = {Keywords: Longest common substring, Longest palindrome substring, Quantum algorithms, Sublinear algorithms}
}