( en | de | ru )

 

Disambiguation of "Funakoshi, Mitsuru"

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.

Mitsuru Makinose

Mitsuru Iijima

 

Other publications of authors with the same name

Computing maximal generalized palindromes., , , , , and . CoRR, (2022)Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space., , , , and . CoRR, (2024)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)A Separation of γ and b via Thue-Morse Words., , , , , and . SPIRE, volume 12944 of Lecture Notes in Computer Science, page 167-178. Springer, (2021)Non-Rectangular Convolutions and (Sub-)Cadences with Three Elements., and . CoRR, (2019)Data Structures for Computing Unique Palindromes in Static and Non-Static Strings., and . Algorithmica, 86 (3): 852-873 (March 2024)On the Approximation Ratio of LZ-End to LZ77., , , , , and . SPIRE, volume 12944 of Lecture Notes in Computer Science, page 114-126. Springer, (2021)Linear Time Online Algorithms for Constructing Linear-size Suffix Trie., , , , and . CoRR, (2023)Optimal LZ-End Parsing Is Hard., , , , , and . CPM, volume 259 of LIPIcs, page 3:1-3:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings., and . IWOCA, volume 13270 of Lecture Notes in Computer Science, page 425-438. Springer, (2022)