( en | de | ru )

 

Disambiguation of "Takeda, Masayuki"

Author of the publication

copydeleteadd this publication to your clipboard
A Faster Algorithm for Computing Maximal -gapped Repeats in a String.

, , , , , and . SPIRE, volume 9309 of Lecture Notes in Computer Science, page 124-136. Springer, (2015)

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

Computing Abelian regularities on RLE strings., , , , and . CoRR, (2017)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)On-line construction of compact directed acyclic word graphs., , , , , , and . Discret. Appl. Math., 146 (2): 156-179 (2005)An Improved Data Structure for Left-Right Maximal Generic Words Problem., , , , and . ISAAC, volume 149 of LIPIcs, page 40:1-40:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Ternary Directed Acyclic Word Graphs., , , and . CIAA, volume 2759 of Lecture Notes in Computer Science, page 120-130. Springer, (2003)Computing Smallest and Largest Repetition Factorizations in O(n log n) Time., , , , , and . Stringology, page 135-145. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2016)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)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)On the Approximation Ratio of LZ-End to LZ77., , , , , and . SPIRE, volume 12944 of Lecture Notes in Computer Science, page 114-126. Springer, (2021)