( en | de | ru )

 

Disambiguation of "Mieno, Takuya"

Author of the publication

copydeleteadd this publication to your clipboard
Internal Longest Palindrome Queries in Optimal Time.

, , , and . WALCOM, volume 13973 of Lecture Notes in Computer Science, page 127-138. Springer, (2023)

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.

Takuya Soma

Takuya Suzuki

 

Other publications of authors with the same name

Computing Minimal Unique Substrings for a Sliding Window., , , , , and . Algorithmica, 84 (3): 670-693 (2022)Internal Longest Palindrome Queries in Optimal Time., , , and . CoRR, (2022)Computing maximal generalized palindromes., , , , , and . CoRR, (2022)Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space., , , , and . CoRR, (2024)Combinatorics of minimal absent words for a sliding window., , , , , , and . CoRR, (2021)A Separation of γ and b via Thue-Morse Words., , , , , and . SPIRE, volume 12944 of Lecture Notes in Computer Science, page 167-178. Springer, (2021)Shortest Unique Palindromic Substring Queries in Optimal Time., , , , , and . IWOCA, volume 10765 of Lecture Notes in Computer Science, page 397-408. Springer, (2017)Combinatorics of minimal absent words for a sliding window., , , , , , and . Theor. Comput. Sci., (2022)Computing Longest Common Subsequence under Cartesian-Tree Matching Model., , , , and . CoRR, (2024)Computing Palindromic Trees for a Sliding Window and Its Applications., , , , , and . CoRR, (2020)