( en | de | ru )

 

Disambiguation of "Takeda, Masayuki"

Author of the publication

copydeleteadd this publication to your clipboard
Compressed Automata for Dictionary Matching.

, , , , and . CIAA, volume 7982 of Lecture Notes in Computer Science, page 319-330. Springer, (2013)

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.

Masayuki Hirosue

Genichiro Takeda

Michiko Takeda

Kijuro Takeda

Takehisa Takeda

 

Other publications of authors with the same name

Faster STR-IC-LCS Computation via RLE., , , , and . CPM, volume 78 of LIPIcs, page 20:1-20:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Factorizing a String into Squares in Linear Time., , , , and . CPM, volume 54 of LIPIcs, page 27:1-27:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On-line construction of compact directed acyclic word graphs., , , , , , and . Discret. Appl. Math., 146 (2): 156-179 (2005)Behavioral Analysis Based on Relations in Weblogs., , , , and . ASWC, volume 4185 of Lecture Notes in Computer Science, page 162-168. Springer, (2006)Discovering instances of poetic allusion from anthologies of classical Japanese poems., , , , and . Theor. Comput. Sci., 292 (2): 497-524 (2003)An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs., , , , , and . IEEE ACM Trans. Comput. Biol. Bioinform., 1 (4): 159-170 (2004)Grammar-compressed Self-index with Lyndon Words., , , , , and . CoRR, (2020)Computing Maximal Palindromes in Non-standard Matching Models., , , , , and . IWOCA, volume 14764 of Lecture Notes in Computer Science, page 165-179. Springer, (2024)Longest Lyndon Substring After Edit., , , , and . CPM, volume 105 of LIPIcs, page 19:1-19:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings., , , , and . ISAAC, volume 92 of LIPIcs, page 33:1-33:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)