( en | de | ru )

 

Disambiguation of "Mieno, Takuya"

Author of the publication

copydeleteadd this publication to your clipboard
Computing Palindromes on a Trie in Linear Time.

, , and . ISAAC, volume 248 of LIPIcs, page 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. 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

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)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)A Separation of γ and b via Thue-Morse Words., , , , , and . SPIRE, volume 12944 of Lecture Notes in Computer Science, page 167-178. Springer, (2021)Minimal Unique Substrings and Minimal Absent Words in a Sliding Window., , , , , , , and . SOFSEM, volume 12011 of Lecture Notes in Computer Science, page 148-160. Springer, (2020)Lyndon Words, the Three Squares Lemma, and Primitive Squares., , and . SPIRE, volume 12303 of Lecture Notes in Computer Science, page 265-273. Springer, (2020)Data Structures for Computing Unique Palindromes in Static and Non-Static Strings., and . Algorithmica, 86 (3): 852-873 (March 2024)Space-efficient algorithms for computing minimal/shortest unique substrings., , , , , and . Theor. Comput. Sci., (2020)