Computing Longest Common Substrings Via Suffix Arrays. - Maxim A. Babenko; Tatiana Starikovskaya (CSR, 2008)

Pattern Matching on Sparse Suffix Trees. - Roman Kolpakov; Gregory Kucherov; Tatiana Starikovskaya (CCP, 2011)

Linear pattern matching on sparse suffix trees - Roman Kolpakov; Gregory Kucherov; Tatiana Starikovskaya (CoRR, 2011)

Computing the longest common substring with one mismatch. - Maxim A. Babenko; Tatiana Starikovskaya (Probl. Inf. Transm., 2011)

Cross-Document Pattern Matching. - Gregory Kucherov; Yakov Nekrich; Tatiana Starikovskaya (CPM, 2012)

Computing Lempel-Ziv Factorization Online. - Tatiana Starikovskaya (MFCS, 2012)

Computing Discriminating and Generic Words. - Gregory Kucherov; Yakov Nekrich; Tatiana Starikovskaya (SPIRE, 2012)

On Minimal and Maximal Suffixes of a Substring. - Maxim A. Babenko; Ignat I. Kolesnichenko; Tatiana Starikovskaya (CPM, 2013)

Time-Space Trade-Offs for the Longest Common Substring Problem. - Tatiana Starikovskaya; Hjalte Wedel Vildhøj (CPM, 2013)

Minimal Discriminating Words Problem Revisited. - Pawel Gawrychowski; Gregory Kucherov; Yakov Nekrich; Tatiana Starikovskaya (SPIRE, 2013)

Substring Suffix Selection. - Maxim A. Babenko; Pawel Gawrychowski; Tomasz Kociumaka; Tatiana Starikovskaya (CoRR, 2013)

Computing Minimal and Maximal Suffixes of a Substring Revisited. - Maxim A. Babenko; Pawel Gawrychowski; Tomasz Kociumaka; Tatiana Starikovskaya (CPM, 2014)

Sublinear Space Algorithms for the Longest Common Substring Problem. - Tomasz Kociumaka; Tatiana Starikovskaya; Hjalte Wedel Vildhøj (ESA, 2014)

Simple and Efficient String Algorithms for Query Suggestion Metrics Computation. - Alexander Loptev; Anna Selugina; Tatiana Starikovskaya (SPIRE, 2014)

Cross-document pattern matching. - Tsvi Kopelowitz; Gregory Kucherov; Yakov Nekrich; Tatiana Starikovskaya (J. Discrete Algorithms, 2014)

On Maximal Unbordered Factors. - Alexander Loptev; Gregory Kucherov; Tatiana Starikovskaya (CPM, 2015)

Dictionary Matching in a Stream. - Raphaël Clifford; Allyx Fontaine; Ely Porat; Benjamin Sach; Tatiana Starikovskaya (ESA, 2015)

Wavelet Trees Meet Suffix Trees. - Maxim A. Babenko; Pawel Gawrychowski; Tomasz Kociumaka; Tatiana Starikovskaya (SODA, 2015)

Computing the Longest Unbordered Substring. - Pawel Gawrychowski; Gregory Kucherov; Benjamin Sach; Tatiana Starikovskaya (SPIRE, 2015)

The k-mismatch problem revisited. - Raphaël Clifford; Allyx Fontaine; Ely Porat; Benjamin Sach; Tatiana Starikovskaya (CoRR, 2015)

A suffix tree or not a suffix tree? - Tatiana Starikovskaya; Hjalte Wedel Vildhøj (J. Discrete Algorithms, 2015)

Longest Common Substring with Approximately k Mismatches. - Tatiana Starikovskaya (CPM, 2016)

Approximate Hamming Distance in a Stream. - Raphaël Clifford; Tatiana Starikovskaya (ICALP, 2016)

The k-mismatch problem revisited. - Raphaël Clifford; Allyx Fontaine; Ely Porat; Benjamin Sach; Tatiana Starikovskaya (SODA, 2016)

Dynamic and Approximate Pattern Matching in 2D. - Raphaël Clifford; Allyx Fontaine; Tatiana Starikovskaya; Hjalte Wedel Vildhøj (SPIRE, 2016)

Streaming k-mismatch with data recovery and applications. - Jakub Radoszewski; Tatiana Starikovskaya (CoRR, 2016)

Computing minimal and maximal suffixes of a substring. - Maxim A. Babenko; Pawel Gawrychowski; Tomasz Kociumaka; Ignat I. Kolesnichenko; Tatiana Starikovskaya (Theor. Comput. Sci., 2016)

Communication and Streaming Complexity of Approximate Pattern Matching. - Tatiana Starikovskaya (CPM, 2017)

Streaming K-Mismatch with Error Correcting and Applications. - Jakub Radoszewski; Tatiana Starikovskaya (DCC, 2017)

Fast Entropy-Bounded String Dictionary Look-Up with Mismatches. - Pawel Gawrychowski; Gad M. Landau; Tatiana Starikovskaya (MFCS, 2018)

Improved bounds for testing Dyck languages. - Eldar Fischer; Frédéric Magniez; Tatiana Starikovskaya (SODA, 2018)

Upper and Lower Bounds for Dynamic Data Structures on Strings. - Raphaël Clifford; Allan Grønlund; Kasper Green Larsen; Tatiana Starikovskaya (STACS, 2018)

Quasi-Periodicity in Streams. - Pawel Gawrychowski; Jakub Radoszewski; Tatiana Starikovskaya (CPM, 2019)

Sliding Window Property Testing for Regular Languages. - Moses Ganardi; Danny Hucke; Markus Lohrey; Tatiana Starikovskaya (ISAAC, 2019)

Lower bounds for text indexing with mismatches and differences. - Vincent Cohen-Addad; Laurent Feuilloley; Tatiana Starikovskaya (SODA, 2019)

Longest Common Substring with Approximately k Mismatches. - Tomasz Kociumaka; Jakub Radoszewski; Tatiana Starikovskaya (Algorithmica, 2019)

Correction to: Longest Common Substring with Approximately k Mismatches. - Tomasz Kociumaka; Jakub Radoszewski; Tatiana Starikovskaya (Algorithmica, 2019)

Lp Pattern Matching in a Stream. - Tatiana Starikovskaya; Michal Svagerka; Przemyslaw Uznanski (APPROX-RANDOM, 2020)

Approximating Longest Common Substring with k mismatches: Theory and Practice. - Garance Gourdel; Tomasz Kociumaka; Jakub Radoszewski; Tatiana Starikovskaya (CPM, 2020)

Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCP. - Kotaro Matsuda; Kunihiko Sadakane; Tatiana Starikovskaya; Masakazu Tateshita (CPM, 2020)

Generalised Pattern Matching Revisited. - Bartlomiej Dudek 001; Pawel Gawrychowski; Tatiana Starikovskaya (STACS, 2020)

All non-trivial variants of 3-LDT are equivalent. - Bartlomiej Dudek 001; Pawel Gawrychowski; Tatiana Starikovskaya (STOC, 2020)

Streaming k-mismatch with error correcting and applications. - Jakub Radoszewski; Tatiana Starikovskaya (Inf. Comput., 2020)

Small-space and streaming pattern matching with $k$ edits. - Tomasz Kociumaka; Ely Porat; Tatiana Starikovskaya (FOCS, 2021)

Property Testing of Regular Languages with Applications to Streaming Property Testing of Visibly Pushdown Languages. - Gabriel Bathie; Tatiana Starikovskaya (ICALP, 2021)

Streaming Pattern Matching (Invited Talk). - Tatiana Starikovskaya (ISAAC, 2021)

Streaming Regular Expression Membership and Pattern Matching. - Bartlomiej Dudek 001; Pawel Gawrychowski; Garance Gourdel; Tatiana Starikovskaya (SODA, 2022)

An Improved Algorithm for The k-Dyck Edit Distance Problem. - Dvir Fried; Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat; Tatiana Starikovskaya (SODA, 2022)

Pattern Matching Under DTW Distance. - Garance Gourdel; Anne Driemel; Pierre Peterlongo; Tatiana Starikovskaya (SPIRE, 2022)

Streaming Dictionary Matching with Mismatches. - Pawel Gawrychowski; Tatiana Starikovskaya (Algorithmica, 2022)

Compressed Indexing for Consecutive Occurrences. - Pawel Gawrychowski; Garance Gourdel; Tatiana Starikovskaya; Teresa Anna Steiner (CPM, 2023)

Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares. - Gabriel Bathie; Tomasz Kociumaka; Tatiana Starikovskaya (ISAAC, 2023)

Publisher Correction: Longest Common Substring with Approximately k Mismatches. - Tomasz Kociumaka; Jakub Radoszewski; Tatiana Starikovskaya (Algorithmica, 2023)

Internal Pattern Matching in Small Space and Applications. - Gabriel Bathie; Panagiotis Charalampopoulos; Tatiana Starikovskaya (CPM, 2024)

Compressed Consecutive Pattern Matching†. - Pawel Gawrychowski; Garance Gourdel; Tatiana Starikovskaya; Teresa Anna Steiner (DCC, 2024)

Longest Common Extensions with Wildcards: Trade-Off and Applications. - Gabriel Bathie; Panagiotis Charalampopoulos; Tatiana Starikovskaya (ESA, 2024)

Pattern Matching with Mismatches and Wildcards. - Gabriel Bathie; Panagiotis Charalampopoulos; Tatiana Starikovskaya (ESA, 2024)

Sorting Signed Permutations by Reversals in Nearly-Linear Time. - Bartlomiej Dudek 001; Pawel Gawrychowski; Tatiana Starikovskaya (SOSA, 2024)

Small Space Encoding and Recognition of k-Palindromic Prefixes. - Gabriel Bathie; Jonas Ellert; Tatiana Starikovskaya (CoRR, 2024)

An Improved Algorithm for The k-Dyck Edit Distance Problem. - Dvir Fried; Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat; Tatiana Starikovskaya (ACM Trans. Algorithms, 2024)

Minimal Generators in Optimal Time. - Jonas Ellert; Pawel Gawrychowski; Tatiana Starikovskaya (CPM, 2025)

Faster two-dimensional pattern matching with k mismatches. - Jonas Ellert; Pawel Gawrychowski; Adam Górkiewicz; Tatiana Starikovskaya (SODA, 2025)

Regular Languages in the Sliding Window Model. - Moses Ganardi; Danny Hucke; Markus Lohrey; Konstantinos Mamouras; Tatiana Starikovskaya (TheoretiCS, 2025)