Follow
Tatiana Starikovskaya
Title
Cited by
Cited by
Year
The k-mismatch problem revisited
R Clifford, A Fontaine, E Porat, B Sach, T Starikovskaya
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
622016
Wavelet trees meet suffix trees
M Babenko, P Gawrychowski, T Kociumaka, T Starikovskaya
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014
522014
Dictionary matching in a stream
R Clifford, A Fontaine, E Porat, B Sach, T Starikovskaya
Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015
372015
Approximate Hamming distance in a stream
R Clifford, T Starikovskaya
arXiv preprint arXiv:1602.07241, 2016
282016
Sublinear space algorithms for the longest common substring problem
T Kociumaka, T Starikovskaya, HW Vildhøj
European Symposium on Algorithms, 605-617, 2014
282014
Streaming k-mismatch with error correcting and applications
J Radoszewski, T Starikovskaya
Information and Computation 271, 104513, 2020
232020
Longest Common Substring with Approximately k Mismatches
T Kociumaka, J Radoszewski, T Starikovskaya
Algorithmica 81 (6), 2633-2652, 2019
222019
Time-space trade-offs for the longest common substring problem
T Starikovskaya, HW Vildhøj
Combinatorial Pattern Matching: 24th Annual Symposium, CPM 2013, Bad …, 2013
222013
Upper and lower bounds for dynamic data structures on strings
R Clifford, A Grønlund, KG Larsen, T Starikovskaya
arXiv preprint arXiv:1802.06545, 2018
202018
A suffix tree or not a suffix tree?
T Starikovskaya, HW Vildhøj
Journal of Discrete Algorithms 32, 14-23, 2015
202015
Computing lempel-ziv factorization online
T Starikovskaya
Mathematical Foundations of Computer Science 2012: 37th International …, 2012
202012
Cross-document pattern matching
T Kopelowitz, G Kucherov, Y Nekrich, T Starikovskaya
Journal of Discrete Algorithms 24, 40-47, 2014
182014
Computing the longest common substring with one mismatch
MA Babenko, TA Starikovskaya
Problems of Information Transmission 47 (1), 28-33, 2011
182011
Computing longest common substrings via suffix arrays
MA Babenko, TA Starikovskaya
Computer Science–Theory and Applications: Third International Computer …, 2008
172008
Communication and streaming complexity of approximate pattern matching
T Starikovskaya
28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017
162017
Computing minimal and maximal suffixes of a substring
M Babenko, P Gawrychowski, T Kociumaka, I Kolesnichenko, ...
Theoretical Computer Science 638, 112-121, 2016
152016
Pattern matching on sparse suffix trees
R Kolpakov, G Kucherov, T Starikovskaya
2011 First International Conference on Data Compression, Communications and …, 2011
142011
Small-space and streaming pattern matching with edits
T Kociumaka, E Porat, T Starikovskaya
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
122022
Longest common substring with approximately k mismatches
T Starikovskaia
27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, 21.1-21.11, 2016
112016
An Improved Algorithm for The k-Dyck Edit Distance Problem
D Fried, S Golan, T Kociumaka, T Kopelowitz, E Porat, T Starikovskaya
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
102022
The system can't perform the operation now. Try again later.
Articles 1–20