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)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)Approximation of RNA Multiple Structural Alignment., , , и . CPM, том 4009 из Lecture Notes in Computer Science, стр. 211-222. Springer, (2006)Polynomial-Time Approximation Algorithms for Weighted LCS Problem., , , , и . CPM, том 6661 из Lecture Notes in Computer Science, стр. 455-466. Springer, (2011)Improved Algorithms for the Range Next Value Problem and Applications., , , , и . STACS, том 1 из LIPIcs, стр. 205-216. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2008)Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays., , , , и . SOFSEM, том 5901 из Lecture Notes in Computer Science, стр. 296-307. Springer, (2010)A Formal Approach to Computer Systems Requirements Documentation., , , , , и . Hybrid Systems, том 736 из Lecture Notes in Computer Science, стр. 452-474. Springer, (1992)New Simple Efficient Algorithms Computing Powers and Runs in Strings., , , , , , и . Stringology, стр. 138-149. Prague Stringology Club, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2010)Extracting Powers and Periods in a String from Its Runs Structure., , , , , и . SPIRE, том 6393 из Lecture Notes in Computer Science, стр. 258-269. Springer, (2010)