| 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 | 58 | 2016 |
| 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 | 49 | 2014 |
| 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 | 36 | 2015 |
| Approximate Hamming distance in a stream R Clifford, T Starikovskaya arXiv preprint arXiv:1602.07241, 2016 | 28 | 2016 |
| Sublinear space algorithms for the longest common substring problem T Kociumaka, T Starikovskaya, HW Vildhøj Algorithms-ESA 2014: 22th Annual European Symposium, Wroclaw, Poland …, 2014 | 26 | 2014 |
| Streaming k-mismatch with error correcting and applications J Radoszewski, T Starikovskaya Information and Computation 271, 104513, 2020 | 22 | 2020 |
| 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 | 21 | 2013 |
| Longest Common Substring with Approximately k Mismatches T Kociumaka, J Radoszewski, T Starikovskaya Algorithmica 81 (6), 2633-2652, 2019 | 19 | 2019 |
| A suffix tree or not a suffix tree? T Starikovskaya, HW Vildhøj Journal of Discrete Algorithms 32, 14-23, 2015 | 18 | 2015 |
| 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 | 17 | 2018 |
| Cross-document pattern matching T Kopelowitz, G Kucherov, Y Nekrich, T Starikovskaya Journal of Discrete Algorithms 24, 40-47, 2014 | 17 | 2014 |
| Computing lempel-ziv factorization online T Starikovskaya Mathematical Foundations of Computer Science 2012: 37th International …, 2012 | 17 | 2012 |
| Computing the longest common substring with one mismatch MA Babenko, TA Starikovskaya Problems of Information Transmission 47 (1), 28-33, 2011 | 17 | 2011 |
| Computing longest common substrings via suffix arrays MA Babenko, TA Starikovskaya Computer Science–Theory and Applications: Third International Computer …, 2008 | 17 | 2008 |
| Computing minimal and maximal suffixes of a substring M Babenko, P Gawrychowski, T Kociumaka, I Kolesnichenko, ... Theoretical Computer Science 638, 112-121, 2016 | 14 | 2016 |
| Pattern matching on sparse suffix trees R Kolpakov, G Kucherov, T Starikovskaya 2011 First International Conference on Data Compression, Communications and …, 2011 | 13 | 2011 |
| Communication and streaming complexity of approximate pattern matching T Starikovskaya 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017 | 12 | 2017 |
| Longest common substring with approximately k mismatches T Starikovskaya 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 2016 | 11 | 2016 |
| Streaming dictionary matching with mismatches P Gawrychowski, T Starikovskaya Algorithmica, 1-21, 2019 | 9 | 2019 |
| On minimal and maximal suffixes of a substring M Babenko, I Kolesnichenko, T Starikovskaya Combinatorial Pattern Matching: 24th Annual Symposium, CPM 2013, Bad …, 2013 | 9 | 2013 |
Paweł GawrychowskiUniversity of WrocławBestätigte E-Mail-Adresse bei cs.uni.wroc.pl
