ملف الباحث
Panagiotis Charalampopoulos
ورقتان في مجموعة PaperMetrix
المنشورات
أوراق هذا المؤلف
-
Internal Shortest Absent Word Queries
2021 · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
Given a string T of length n over an alphabet Σ ⊂ {1,2,…,n^{𝒪(1)}} of size σ, we are to preprocess T so that given a range [i,j], we can return a representation of a shortest …
-
Periodicity Property Testing on Strings with Wildcards
2026 · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
In this work, we study periodicity in strings with wildcards. A string T with at most k wildcards is called strongly (p,k)-periodic if the wildcards in T can be replaced with alphabet symbols to obtain …