( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On Minimal and Maximal Suffixes of a Substring.

, , и . CPM, том 7922 из Lecture Notes in Computer Science, стр. 28-37. Springer, (2013)

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.

Tatiana Binder

Tatiana Cisyk

Tatiana Konowalowa

Tatiana Paterna

Tatiana Burguete

 

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

Substring Suffix Selection., , , и . CoRR, (2013)Computing Lempel-Ziv Factorization Online.. MFCS, том 7464 из Lecture Notes in Computer Science, стр. 789-799. Springer, (2012)On Minimal and Maximal Suffixes of a Substring., , и . CPM, том 7922 из Lecture Notes in Computer Science, стр. 28-37. Springer, (2013)On Maximal Unbordered Factors., , и . CPM, том 9133 из Lecture Notes in Computer Science, стр. 343-354. Springer, (2015)A Suffix Tree Or Not a Suffix Tree?, и . IWOCA, том 8986 из Lecture Notes in Computer Science, стр. 338-350. Springer, (2014)Dynamic and Approximate Pattern Matching in 2D., , , и . SPIRE, том 9954 из Lecture Notes in Computer Science, стр. 133-144. (2016)Cross-document pattern matching., , , и . J. Discrete Algorithms, (2014)Upper and Lower Bounds for Dynamic Data Structures on Strings., , , и . STACS, том 96 из LIPIcs, стр. 22:1-22:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Communication and Streaming Complexity of Approximate Pattern Matching.. CPM, том 78 из LIPIcs, стр. 13:1-13:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Compressed Indexing for Consecutive Occurrences., , , и . CPM, том 259 из LIPIcs, стр. 12:1-12:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)