( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Computing Palindromes on a Trie in Linear Time.

, , и . ISAAC, том 248 из LIPIcs, стр. 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.

Shunsuke Saito

 

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

Time and Space Efficient Lempel-Ziv Factorization based on Run Length Encoding, , , и . CoRR, (2012)Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries.. CoRR, (2019)Inferring Strings from Lyndon Factorization., , , , , и . MFCS (2), том 8635 из Lecture Notes in Computer Science, стр. 565-576. Springer, (2014)Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings., , , , и . ISAAC, том 92 из LIPIcs, стр. 33:1-33:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Faster STR-IC-LCS Computation via RLE., , , , и . CPM, том 78 из LIPIcs, стр. 20:1-20:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations., , , , и . CPM, том 128 из LIPIcs, стр. 29:1-29:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Factorizing a String into Squares in Linear Time., , , , и . CPM, том 54 из LIPIcs, стр. 27:1-27:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)From Run Length Encoding to LZ78 and Back Again., , , , и . DCC, стр. 143-152. IEEE, (2013)Minimal Unique Substrings and Minimal Absent Words in a Sliding Window., , , , , , , и . SOFSEM, том 12011 из Lecture Notes in Computer Science, стр. 148-160. Springer, (2020)An Improved Data Structure for Left-Right Maximal Generic Words Problem., , , , и . ISAAC, том 149 из LIPIcs, стр. 40:1-40:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)