( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Computing Palindromes on a Trie in Linear Time.

, , и . ISAAC, том 248 из LIPIcs, стр. 15:1-15:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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.

Takuya Soma

Takuya Suzuki

 

Другие публикации лиц с тем же именем

Computing Minimal Unique Substrings for a Sliding Window., , , , , и . Algorithmica, 84 (3): 670-693 (2022)Internal Longest Palindrome Queries in Optimal Time., , , и . CoRR, (2022)Computing maximal generalized palindromes., , , , , и . CoRR, (2022)Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space., , , , и . CoRR, (2024)Combinatorics of minimal absent words for a sliding window., , , , , , и . CoRR, (2021)A Separation of γ and b via Thue-Morse Words., , , , , и . SPIRE, том 12944 из Lecture Notes in Computer Science, стр. 167-178. Springer, (2021)Tight Bounds on the Maximum Number of Shortest Unique Substrings., , , и . CPM, том 78 из LIPIcs, стр. 24:1-24:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Tight bound on the maximum number of shortest unique substrings., , , и . CoRR, (2016)Palindromic trees for a sliding window and its applications., , , , , и . Inf. Process. Lett., (2022)Sliding suffix trees simplified., , , и . CoRR, (2023)