( en | de | ru )

 

Disambiguation of "Mieno, Takuya"

Author of the publication

copydeleteadd this publication to your clipboard
Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space.

, , , , and . IWOCA, volume 14764 of Lecture Notes in Computer Science, page 327-340. Springer, (2024)

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

A Separation of γ and b via Thue-Morse Words., , , , , and . SPIRE, volume 12944 of Lecture Notes in Computer Science, page 167-178. Springer, (2021)Combinatorics of minimal absent words for a sliding window., , , , , , and . CoRR, (2021)Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space., , , , and . IWOCA, volume 14764 of Lecture Notes in Computer Science, page 327-340. Springer, (2024)Computing Minimal Unique Substrings for a Sliding Window., , , , , and . Algorithmica, 84 (3): 670-693 (2022)Tight Bounds on the Maximum Number of Shortest Unique Substrings., , , and . CPM, volume 78 of LIPIcs, page 24:1-24:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions., , , and . SPIRE, volume 13617 of Lecture Notes in Computer Science, page 24-37. Springer, (2022)Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings., , , , and . SPIRE, volume 14240 of Lecture Notes in Computer Science, page 331-344. Springer, (2023)Computing Longest Common Subsequence Under Cartesian-Tree Matching Model., , , , and . IWOCA, volume 14764 of Lecture Notes in Computer Science, page 369-381. Springer, (2024)Cartesian Tree Subsequence Matching., , , , and . CPM, volume 223 of LIPIcs, page 14:1-14:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings., and . IWOCA, volume 13270 of Lecture Notes in Computer Science, page 425-438. Springer, (2022)