( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
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)

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 Rudorferová

 

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

Time-Space Trade-Offs for the Longest Common Substring Problem., и . CPM, том 7922 из Lecture Notes in Computer Science, стр. 223-234. Springer, (2013)Computing minimal and maximal suffixes of a substring., , , , и . Theor. Comput. Sci., (2016)Lower bounds for text indexing with mismatches and differences., , и . SODA, стр. 1146-1164. SIAM, (2019)Longest Common Substring with Approximately k Mismatches.. CPM, том 54 из LIPIcs, стр. 21:1-21:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Generalised Pattern Matching Revisited., , и . STACS, том 154 из LIPIcs, стр. 18:1-18:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)All non-trivial variants of 3-LDT are equivalent., , и . STOC, стр. 974-981. ACM, (2020)Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares., , и . ISAAC, том 283 из LIPIcs, стр. 10:1-10:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Approximate Hamming Distance in a Stream., и . ICALP, том 55 из LIPIcs, стр. 20:1-20:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Linear pattern matching on sparse suffix trees, , и . CoRR, (2011)Streaming Regular Expression Membership and Pattern Matching., , , и . SODA, стр. 670-694. SIAM, (2022)