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 Cost of Interchange Rearrangement in Strings., , , , и . ESA, том 4698 из Lecture Notes in Computer Science, стр. 99-110. Springer, (2007)Longest Common Subsequence in k Length Substrings., , и . SISAP, том 8199 из Lecture Notes in Computer Science, стр. 257-265. Springer, (2013)Quasi-distinct Parsing and Optimal Compression Methods., , , и . CPM, том 5577 из Lecture Notes in Computer Science, стр. 12-25. Springer, (2009)Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap., , , , , и . ISAAC, том 64 из LIPIcs, стр. 12:1-12:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Exploiting Pseudo-locality of Interchange Distance.. SPIRE, том 12944 из Lecture Notes in Computer Science, стр. 227-240. Springer, (2021)Approximate String Matching with Stuck Address Bits., , , , и . SPIRE, том 6393 из Lecture Notes in Computer Science, стр. 395-405. Springer, (2010)Mind the Gap! - Online Dictionary Matching with One Gap., , , , , и . Algorithmica, 81 (6): 2123-2157 (2019)Approximate Period Detection and Correction., и . SPIRE, том 7608 из Lecture Notes in Computer Science, стр. 1-15. Springer, (2012)Multidimensional Period Recovery., , , , и . SPIRE, том 12303 из Lecture Notes in Computer Science, стр. 115-130. Springer, (2020)Quasi-Periodicity Under Mismatch Errors., , и . CPM, том 105 из LIPIcs, стр. 4:1-4:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)