Author of the publication

Shortest Unique Palindromic Substring Queries in Optimal Time.

, , , , , and . IWOCA, volume 10765 of Lecture Notes in Computer Science, page 397-408. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Computing Minimal Unique Substrings for a Sliding Window., , , , , and . Algorithmica, 84 (3): 670-693 (2022)Combinatorics of minimal absent words for a sliding window., , , , , , and . CoRR, (2021)The Parameterized Suffix Tray., , , , and . CoRR, (2020)Computing Left-Right Maximal Generic Words., , , , and . Stringology, page 5-16. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2015)Computing Maximal Palindromes and Distinct Palindromes in a Trie., , , , and . Stringology, page 3-15. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science, (2019)Faster STR-EC-LCS Computation., , , , and . SOFSEM, volume 12011 of Lecture Notes in Computer Science, page 125-135. Springer, (2020)On Sensitivity of Compact Directed Acyclic Word Graphs., , and . WORDS, volume 13899 of Lecture Notes in Computer Science, page 168-180. Springer, (2023)Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays., , , , and . SPIRE, volume 11147 of Lecture Notes in Computer Science, page 254-267. Springer, (2018)Position Heaps for Cartesian-Tree Matching on Strings and Tries., , , and . SPIRE, volume 12944 of Lecture Notes in Computer Science, page 241-254. Springer, (2021)Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets., , , , and . SPIRE, volume 11811 of Lecture Notes in Computer Science, page 382-391. Springer, (2019)