@InProceedings{badkobeh_et_al:LIPIcs.CPM.2021.6,
author = {Badkobeh, Golnaz and Charalampopoulos, Panagiotis and Pissis, Solon P.},
title = {{Internal Shortest Absent Word Queries}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {6:1--6:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.6},
URN = {urn:nbn:de:0030-drops-139570},
doi = {10.4230/LIPIcs.CPM.2021.6},
annote = {Keywords: string algorithms, internal queries, shortest absent word, bit parallelism}
}