From post

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.

 

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

On the Maximal Number of Cubic Runs in a String., , , , , и . LATA, том 6031 из Lecture Notes in Computer Science, стр. 227-238. Springer, (2010)Universal Reconstruction of a String., , , , и . WADS, том 9214 из Lecture Notes in Computer Science, стр. 386-397. Springer, (2015)Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties., и . CPM, том 54 из LIPIcs, стр. 8:1-8:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Longest Common Factor After One Edit Operation., , , , и . SPIRE, том 10508 из Lecture Notes in Computer Science, стр. 14-26. Springer, (2017)Efficient counting of square substrings in a tree., , , , и . Theor. Comput. Sci., (2014)Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence., , и . CPM, том 8486 из Lecture Notes in Computer Science, стр. 202-211. Springer, (2014)Covering Problems for Partial Words and for Indeterminate Strings., , , , , и . ISAAC, том 8889 из Lecture Notes in Computer Science, стр. 220-232. Springer, (2014)Efficient Computation of Sequence Mappability., , , , , , и . SPIRE, том 11147 из Lecture Notes in Computer Science, стр. 12-26. Springer, (2018)A linear time algorithm for seeds computation., , , , и . SODA, стр. 1095-1112. SIAM, (2012)The Maximum Number of Squares in a Tree., , , , , , , и . CPM, том 7354 из Lecture Notes in Computer Science, стр. 27-40. Springer, (2012)