Tatiana Starikovskaya

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 67

Top Topics

Pattern Matching

Regular Languages

Top Venues

Publications

Gabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya
Internal Pattern Matching in Small Space and Applications. CPM (2024)
Gabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya
Pattern Matching with Mismatches and Wildcards. CoRR (2024)
Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya, Teresa Anna Steiner
. DCC (2024)
Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya
Sorting Signed Permutations by Reversals in Nearly-Linear Time. SOSA (2024)
Moses Ganardi, Danny Hucke, Markus Lohrey, Konstantinos Mamouras, Tatiana Starikovskaya
Regular Languages in the Sliding Window Model. CoRR (2024)
Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya
-Dyck Edit Distance Problem. ACM Trans. Algorithms 20 (3) (2024)
Gabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya
Internal Pattern Matching in Small Space and Applications. CoRR (2024)
Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya
Publisher Correction: Longest Common Substring with Approximately k Mismatches. Algorithmica 85 (10) (2023)
Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya, Teresa Anna Steiner
Compressed Indexing for Consecutive Occurrences. CoRR (2023)
Gabriel Bathie, Tomasz Kociumaka, Tatiana Starikovskaya
Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares. CoRR (2023)
Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya
Sorting Signed Permutations by Reversals in Nearly-Linear Time. CoRR (2023)
Gabriel Bathie, Tomasz Kociumaka, Tatiana Starikovskaya
Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares. ISAAC (2023)
Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya, Teresa Anna Steiner
Compressed Indexing for Consecutive Occurrences. CPM (2023)
Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya
An Improved Algorithm for The k-Dyck Edit Distance Problem. SODA (2022)
Garance Gourdel, Anne Driemel, Pierre Peterlongo, Tatiana Starikovskaya
Pattern Matching Under rmDTW Distance. SPIRE (2022)
Garance Gourdel, Anne Driemel, Pierre Peterlongo, Tatiana Starikovskaya
Pattern matching under DTW distance. CoRR (2022)
Pawel Gawrychowski, Tatiana Starikovskaya
Streaming Dictionary Matching with Mismatches. Algorithmica 84 (4) (2022)
Tomasz Kociumaka, Ely Porat, Tatiana Starikovskaya
Small-space and streaming pattern matching with $k$ edits. FOCS (2022)
Bartlomiej Dudek, Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya
Streaming Regular Expression Membership and Pattern Matching. SODA (2022)
Tatiana Starikovskaya
Streaming Pattern Matching (Invited Talk). ISAAC (2021)
Gabriel Bathie, Tatiana Starikovskaya
Property Testing of Regular Languages with Applications to Streaming Property Testing of Visibly Pushdown Languages. ICALP (2021)
Tomasz Kociumaka, Ely Porat, Tatiana Starikovskaya
Small-space and streaming pattern matching with $k$ edits. FOCS (2021)
Tomasz Kociumaka, Ely Porat, Tatiana Starikovskaya
Small space and streaming pattern matching with k edits. CoRR (2021)
Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya
An Improved Algorithm for The k-Dyck Edit Distance Problem. CoRR (2021)
Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya
Approximating Longest Common Substring with k mismatches: Theory and Practice. CPM (2020)
Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya
All non-trivial variants of 3-LDT are equivalent. CoRR (2020)
Tatiana Starikovskaya, Michal Svagerka, Przemyslaw Uznanski
Pattern Matching in a Stream. APPROX-RANDOM (2020)
Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya
Approximating longest common substring with $k$ mismatches: Theory and practice. CoRR (2020)
Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya
All non-trivial variants of 3-LDT are equivalent. STOC (2020)
Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya
Generalised Pattern Matching Revisited. STACS (2020)
Kotaro Matsuda, Kunihiko Sadakane, Tatiana Starikovskaya, Masakazu Tateshita
Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCP. CPM (2020)
Jakub Radoszewski, Tatiana Starikovskaya
-mismatch with error correcting and applications. Inf. Comput. 271 (2020)
Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya
Generalised Pattern Matching Revisited. CoRR (2020)
Pawel Gawrychowski, Tatiana Starikovskaya
Streaming Dictionary Matching with Mismatches. CPM (2019)
Vincent Cohen-Addad, Laurent Feuilloley, Tatiana Starikovskaya
Lower bounds for text indexing with mismatches and differences. SODA (2019)
Moses Ganardi, Danny Hucke, Markus Lohrey, Tatiana Starikovskaya
Sliding Window Property Testing for Regular Languages. ISAAC (2019)
Tatiana Starikovskaya, Michal Svagerka, Przemyslaw Uznanski
Pattern Matching in a Stream. CoRR (2019)
Moses Ganardi, Danny Hucke, Markus Lohrey, Tatiana Starikovskaya
Sliding window property testing for regular languages. CoRR (2019)
Pawel Gawrychowski, Jakub Radoszewski, Tatiana Starikovskaya
Quasi-Periodicity in Streams. CPM (2019)
Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya
Longest Common Substring with Approximately k Mismatches. Algorithmica 81 (6) (2019)
Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya
Correction to: Longest Common Substring with Approximately k Mismatches. Algorithmica 81 (7) (2019)
Pawel Gawrychowski, Tatiana Starikovskaya
Streaming dictionary matching with mismatches. CoRR (2018)
Raphaël Clifford, Allan Grønlund, Kasper Green Larsen, Tatiana Starikovskaya
Upper and lower bounds for dynamic data structures on strings. CoRR (2018)
Eldar Fischer, Frédéric Magniez, Tatiana Starikovskaya
Improved bounds for testing Dyck languages. SODA (2018)
Vincent Cohen-Addad, Laurent Feuilloley, Tatiana Starikovskaya
Lower bounds for text indexing with mismatches and differences. CoRR (2018)
Raphaël Clifford, Allan Grønlund, Kasper Green Larsen, Tatiana Starikovskaya
Upper and Lower Bounds for Dynamic Data Structures on Strings. STACS (2018)
Pawel Gawrychowski, Gad M. Landau, Tatiana Starikovskaya
Fast entropy-bounded string dictionary look-up with mismatches. CoRR (2018)
Pawel Gawrychowski, Gad M. Landau, Tatiana Starikovskaya
Fast Entropy-Bounded String Dictionary Look-Up with Mismatches. MFCS (2018)
Jakub Radoszewski, Tatiana Starikovskaya
Streaming K-Mismatch with Error Correcting and Applications. DCC (2017)
Eldar Fischer, Frédéric Magniez, Tatiana Starikovskaya
Improved bounds for testing Dyck languages. CoRR (2017)
Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya
Longest common substring with approximately k mismatches. CoRR (2017)
Tatiana Starikovskaya
Communication and Streaming Complexity of Approximate Pattern Matching. CPM (2017)
Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya
-mismatch problem revisited. SODA (2016)
Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Ignat I. Kolesnichenko, Tatiana Starikovskaya
Computing minimal and maximal suffixes of a substring. Theor. Comput. Sci. 638 (2016)
Raphaël Clifford, Tatiana Starikovskaya
Approximate Hamming Distance in a Stream. ICALP (2016)
Raphaël Clifford, Allyx Fontaine, Tatiana Starikovskaya, Hjalte Wedel Vildhøj
Dynamic and Approximate Pattern Matching in 2D. SPIRE (2016)
Tatiana Starikovskaya
Longest Common Substring with Approximately k Mismatches. CPM (2016)
Raphaël Clifford, Tatiana Starikovskaya
Approximate Hamming distance in a stream. CoRR (2016)
Jakub Radoszewski, Tatiana Starikovskaya
Streaming k-mismatch with data recovery and applications. CoRR (2016)
Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya
The k-mismatch problem revisited. CoRR (2015)
Alexander Loptev, Gregory Kucherov, Tatiana Starikovskaya
On Maximal Unbordered Factors. CPM (2015)
Pawel Gawrychowski, Gregory Kucherov, Benjamin Sach, Tatiana Starikovskaya
Computing the Longest Unbordered Substring. SPIRE (2015)
Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya
Dictionary matching in a stream. CoRR (2015)
Gregory Kucherov, Alexander Loptev, Tatiana Starikovskaya
On Maximal Unbordered Factors. CoRR (2015)
Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya
Dictionary Matching in a Stream. ESA (2015)
Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya
Wavelet Trees Meet Suffix Trees. SODA (2015)
Tatiana Starikovskaya, Hjalte Wedel Vildhøj
A suffix tree or not a suffix tree? J. Discrete Algorithms 32 (2015)
Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya
Computing Minimal and Maximal Suffixes of a Substring Revisited. CPM (2014)
Tsvi Kopelowitz, Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya
Cross-document pattern matching. J. Discrete Algorithms 24 (2014)
Tomasz Kociumaka, Tatiana Starikovskaya, Hjalte Wedel Vildhøj
Sublinear Space Algorithms for the Longest Common Substring Problem. ESA (2014)
Tatiana Starikovskaya, Hjalte Wedel Vildhøj
A Suffix Tree Or Not a Suffix Tree? IWOCA (2014)
Alexander Loptev, Anna Selugina, Tatiana Starikovskaya
Simple and Efficient String Algorithms for Query Suggestion Metrics Computation. SPIRE (2014)
Tomasz Kociumaka, Tatiana Starikovskaya, Hjalte Wedel Vildhøj
Sublinear Space Algorithms for the Longest Common Substring Problem. CoRR (2014)
Tatiana Starikovskaya, Hjalte Wedel Vildhøj
A Suffix Tree Or Not A Suffix Tree? CoRR (2014)
Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya
Wavelet Trees Meet Suffix Trees. CoRR (2014)
Pawel Gawrychowski, Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya
Minimal Discriminating Words Problem Revisited. SPIRE (2013)
Tatiana Starikovskaya, Hjalte Wedel Vildhøj
Time-Space Trade-Offs for the Longest Common Substring Problem. CPM (2013)
Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya
Substring Suffix Selection. CoRR (2013)
Maxim A. Babenko, Ignat I. Kolesnichenko, Tatiana Starikovskaya
On Minimal and Maximal Suffixes of a Substring. CPM (2013)
Tatiana Starikovskaya
Computing Lempel-Ziv Factorization Online. MFCS (2012)
Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya
Cross-Document Pattern Matching. CPM (2012)
Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya
Computing Discriminating and Generic Words. SPIRE (2012)
Tatiana Starikovskaya
Computing Lempel-Ziv Factorization Online CoRR (2012)
Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya
Cross-Document Pattern Matching CoRR (2012)
Roman Kolpakov, Gregory Kucherov, Tatiana Starikovskaya
Pattern Matching on Sparse Suffix Trees. CCP (2011)
Roman Kolpakov, Gregory Kucherov, Tatiana Starikovskaya
Linear pattern matching on sparse suffix trees CoRR (2011)
Maxim A. Babenko, Tatiana Starikovskaya
Computing the longest common substring with one mismatch. Probl. Inf. Transm. 47 (1) (2011)
Maxim A. Babenko, Tatiana Starikovskaya
Computing Longest Common Substrings Via Suffix Arrays. CSR (2008)