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.

 

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

Faster algorithms for string matching with k mismatches., , и . J. Algorithms, 50 (2): 257-275 (2004)Function Matching., , , и . SIAM J. Comput., 35 (5): 1007-1022 (2006)Efficient Pattern Matching with Scaling., , и . J. Algorithms, 13 (1): 2-32 (1992)Inplace run-length 2d compressed search., , и . SODA, стр. 817-818. ACM/SIAM, (2000)Pattern matching with address errors: rearrangement distances., , , , , , , и . SODA, стр. 1221-1229. ACM Press, (2006)Approximate subset matching with Don't Cares., , и . SODA, стр. 305-306. ACM/SIAM, (2001)Cartesian Tree Matching and Indexing., , , и . CPM, том 128 из LIPIcs, стр. 16:1-16:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Can We Recover the Cover?., , , , и . CPM, том 78 из LIPIcs, стр. 25:1-25:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Two-Dimensional Maximal Repetitions., , , и . ESA, том 112 из LIPIcs, стр. 2:1-2:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On Representations of Ternary Order Relations in Numeric Strings., , , , и . Math. Comput. Sci., 11 (2): 127-136 (2017)