Internal shortest absent word queries in constant time and linear space › Research Explorer

Internal shortest absent word queries in constant time and linear space

Research output: Contribution to journal › Article › peer-review

DOI

https://doi.org/10.1016/j.tcs.2022.04.029
Final published version

Golnaz Badkobeh
Panagiotis Charalampopoulos
Dmitry Kosolobov
Solon P. Pissis

Original language	English
Pages (from-to)	271-282
Number of pages	12
Journal	Theoretical Computer Science
Volume	922
DOIs	https://doi.org/10.1016/j.tcs.2022.04.029
Publication status	Published - 24 Jun 2022

WoS ResearchAreas Categories

Computer Science, Cybernetics

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Research areas

Bit parallelism, Internal queries, Shortest absent word, String algorithms

ID: 30538891