Internal shortest absent word queries in constant time and linear space

Badkobeh, Golnaz; Charalampopoulos, Panagiotis; Kosolobov, Dmitry and Pissis, Solon P.. 2022. Internal shortest absent word queries in constant time and linear space. Theoretical Computer Science, 922, pp. 271-282. ISSN 0304-3975 [Article]
Copy
Item Type Article
Additional Information

The present paper is an extended and improved version of an earlier text that appeared in the 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021
Keywords String algorithms, Internal queries, Shortest absent word, Bit parallelism
Departments, Centres and Research Units Computing
Date Deposited 15 Jun 2022 08:47
Last Modified 26 Apr 2023 01:26

Explore Further

picture_as_pdf
Range_Absent_Words.pdf
subject
Accepted Version
Available under Creative Commons: Attribution-NonCommercial-No Derivative Works 4.0
View Download

Atom BibTeX OpenURL ContextObject in Span OpenURL ContextObject Dublin Core Dublin Core MPEG-21 DIDL Data Cite XML EndNote HTML Citation METS MODS RIOXX2 XML Reference Manager Refer ASCII Citation
Export

Downloads