( en | de | ru )

 

Disambiguation of "Takeda, Masayuki"

Author of the publication

copydeleteadd this publication to your clipboard
Computing Abelian regularities on RLE strings.

, , , , and . CoRR, (2017)

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

Time and Space Efficient Lempel-Ziv Factorization based on Run Length Encoding, , , and . CoRR, (2012)A new characterization of maximal repetitions by Lyndon trees., , , , , and . CoRR, (2014)Computing Abelian regularities on RLE strings., , , , and . CoRR, (2017)A comparison study between genetic algorithms and bayesian optimize algorithms by novel indices., , and . GECCO, page 1485-1492. ACM, (2005)Inferring Strings from Lyndon Factorization., , , , , and . MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 565-576. Springer, (2014)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)On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations., , , , and . CPM, volume 128 of LIPIcs, page 29:1-29:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)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)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)Compressed Pattern Matching.. Encyclopedia of Algorithms, Springer, (2008)