( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Inferring strings from Lyndon factorization.

, , , , , и . Theor. Comput. Sci., (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.

Tomohiro Shibata

Tomohiro Genka

Tomohiro Hayashi

Nata i i

imun Ko i i

 

Другие публикации лиц с тем же именем

From Run Length Encoding to LZ78 and Back Again., , , , и . DCC, стр. 143-152. IEEE, (2013)Space-Efficient B Trees via Load-Balancing., и . IWOCA, том 13270 из Lecture Notes in Computer Science, стр. 327-340. Springer, (2022)LZ-ABT: A Practical Algorithm for α-Balanced Grammar Compression., , , , и . IWOCA, том 10979 из Lecture Notes in Computer Science, стр. 323-335. Springer, (2018)Inferring Strings from Lyndon Factorization., , , , , и . MFCS (2), том 8635 из Lecture Notes in Computer Science, стр. 565-576. Springer, (2014)Practical Random Access to SLP-Compressed Texts., , , , , , и . SPIRE, том 12303 из Lecture Notes in Computer Science, стр. 221-231. Springer, (2020)Compressed Automata for Dictionary Matching., , , , и . CIAA, том 7982 из Lecture Notes in Computer Science, стр. 319-330. Springer, (2013)A Faster Algorithm for Computing Maximal -gapped Repeats in a String., , , , , и . SPIRE, том 9309 из Lecture Notes in Computer Science, стр. 124-136. Springer, (2015)Palindrome Pattern Matching., , и . CPM, том 6661 из Lecture Notes in Computer Science, стр. 232-245. Springer, (2011)Faster Compact On-Line Lempel-Ziv Factorization., , , , и . STACS, том 25 из LIPIcs, стр. 675-686. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)RePair in Compressed Space and Time., , , , , и . DCC, стр. 518-527. IEEE, (2019)