default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTatiana Starikovskaya
Person information
- affiliation: ENS Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j10]Dvir Fried
, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya:
An Improved Algorithm for The k-Dyck Edit Distance Problem. ACM Trans. Algorithms 20(3): 26 (2024)- [c47]Gabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya:
Internal Pattern Matching in Small Space and Applications. CPM 2024: 4:1-4:20 - [c46]Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya, Teresa Anna Steiner:
Compressed Consecutive Pattern Matching†. DCC 2024: 163-172 - [c45]Gabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya:
Longest Common Extensions with Wildcards: Trade-Off and Applications. ESA 2024: 19:1-19:17 - [c44]Gabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya:
Pattern Matching with Mismatches and Wildcards. ESA 2024: 20:1-20:15 - [c43]Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya:
Sorting Signed Permutations by Reversals in Nearly-Linear Time. SOSA 2024: 199-214 - [i34]Gabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya:
Pattern Matching with Mismatches and Wildcards. CoRR abs/2402.07732 (2024) - [i33]Moses Ganardi, Danny Hucke, Markus Lohrey, Konstantinos Mamouras, Tatiana Starikovskaya:
Regular Languages in the Sliding Window Model. CoRR abs/2402.13385 (2024) - [i32]Gabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya:
Internal Pattern Matching in Small Space and Applications. CoRR abs/2404.17502 (2024) - [i31]Gabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya:
Longest Common Extensions with Wildcards: Trade-off and Applications. CoRR abs/2408.03610 (2024) - [i30]Gabriel Bathie, Jonas Ellert, Tatiana Starikovskaya:
Small Space Encoding and Recognition of k-Palindromic Prefixes. CoRR abs/2410.03309 (2024) - 2023
- [j9]Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya:
Publisher Correction: Longest Common Substring with Approximately k Mismatches. Algorithmica 85(10): 3323 (2023) - [c42]Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya, Teresa Anna Steiner:
Compressed Indexing for Consecutive Occurrences. CPM 2023: 12:1-12:22 - [c41]Gabriel Bathie, Tomasz Kociumaka, Tatiana Starikovskaya:
Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares. ISAAC 2023: 10:1-10:17 - [i29]Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya, Teresa Anna Steiner:
Compressed Indexing for Consecutive Occurrences. CoRR abs/2304.00887 (2023) - [i28]Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya:
Sorting Signed Permutations by Reversals in Nearly-Linear Time. CoRR abs/2308.15928 (2023) - [i27]Gabriel Bathie, Tomasz Kociumaka, Tatiana Starikovskaya:
Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares. CoRR abs/2309.14788 (2023) - 2022
- [j8]Pawel Gawrychowski, Tatiana Starikovskaya:
Streaming Dictionary Matching with Mismatches. Algorithmica 84(4): 896-916 (2022) - [c40]Bartlomiej Dudek, Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya:
Streaming Regular Expression Membership and Pattern Matching. SODA 2022: 670-694 - [c39]Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya:
An Improved Algorithm for The k-Dyck Edit Distance Problem. SODA 2022: 3650-3669 - [c38]Garance Gourdel, Anne Driemel, Pierre Peterlongo, Tatiana Starikovskaya:
Pattern Matching Under DTW Distance. SPIRE 2022: 315-330 - [i26]Garance Gourdel, Anne Driemel, Pierre Peterlongo, Tatiana Starikovskaya:
Pattern matching under DTW distance. CoRR abs/2208.14669 (2022) - 2021
- [c37]Tomasz Kociumaka, Ely Porat, Tatiana Starikovskaya:
Small-space and streaming pattern matching with $k$ edits. FOCS 2021: 885-896 - [c36]Gabriel Bathie, Tatiana Starikovskaya:
Property Testing of Regular Languages with Applications to Streaming Property Testing of Visibly Pushdown Languages. ICALP 2021: 119:1-119:17 - [c35]Tatiana Starikovskaya:
Streaming Pattern Matching (Invited Talk). ISAAC 2021: 1:1-1:1 - [e1]Pawel Gawrychowski, Tatiana Starikovskaya:
32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland. LIPIcs 191, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-186-3 [contents] - [i25]Tomasz Kociumaka, Ely Porat, Tatiana Starikovskaya:
Small space and streaming pattern matching with k edits. CoRR abs/2106.06037 (2021) - [i24]Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya:
An Improved Algorithm for The k-Dyck Edit Distance Problem. CoRR abs/2111.02336 (2021) - 2020
- [j7]Jakub Radoszewski, Tatiana Starikovskaya:
Streaming k-mismatch with error correcting and applications. Inf. Comput. 271: 104513 (2020) - [c34]Tatiana Starikovskaya, Michal Svagerka, Przemyslaw Uznanski:
Lp Pattern Matching in a Stream. APPROX-RANDOM 2020: 35:1-35:23 - [c33]Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya:
Approximating Longest Common Substring with k mismatches: Theory and Practice. CPM 2020: 16:1-16:15 - [c32]Kotaro Matsuda, Kunihiko Sadakane, Tatiana Starikovskaya, Masakazu Tateshita:
Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCP. CPM 2020: 23:1-23:13 - [c31]Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya:
Generalised Pattern Matching Revisited. STACS 2020: 18:1-18:18 - [c30]Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya:
All non-trivial variants of 3-LDT are equivalent. STOC 2020: 974-981 - [i23]Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya:
All non-trivial variants of 3-LDT are equivalent. CoRR abs/2001.01289 (2020) - [i22]Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya:
Generalised Pattern Matching Revisited. CoRR abs/2001.05976 (2020) - [i21]Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya:
Approximating longest common substring with $k$ mismatches: Theory and practice. CoRR abs/2004.13389 (2020)
2010 – 2019
- 2019
- [j6]Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya:
Longest Common Substring with Approximately k Mismatches. Algorithmica 81(6): 2633-2652 (2019) - [j5]Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya:
Correction to: Longest Common Substring with Approximately k Mismatches. Algorithmica 81(7): 3074 (2019) - [c29]Pawel Gawrychowski, Tatiana Starikovskaya:
Streaming Dictionary Matching with Mismatches. CPM 2019: 21:1-21:15 - [c28]Pawel Gawrychowski, Jakub Radoszewski, Tatiana Starikovskaya:
Quasi-Periodicity in Streams. CPM 2019: 22:1-22:14 - [c27]Moses Ganardi, Danny Hucke, Markus Lohrey, Tatiana Starikovskaya:
Sliding Window Property Testing for Regular Languages. ISAAC 2019: 6:1-6:13 - [c26]Vincent Cohen-Addad, Laurent Feuilloley, Tatiana Starikovskaya:
Lower bounds for text indexing with mismatches and differences. SODA 2019: 1146-1164 - [i20]Tatiana Starikovskaya, Michal Svagerka, Przemyslaw Uznanski:
Lp Pattern Matching in a Stream. CoRR abs/1907.04405 (2019) - [i19]Moses Ganardi, Danny Hucke, Markus Lohrey, Tatiana Starikovskaya:
Sliding window property testing for regular languages. CoRR abs/1909.10261 (2019) - 2018
- [c25]Pawel Gawrychowski, Gad M. Landau, Tatiana Starikovskaya:
Fast Entropy-Bounded String Dictionary Look-Up with Mismatches. MFCS 2018: 66:1-66:15 - [c24]Eldar Fischer, Frédéric Magniez, Tatiana Starikovskaya:
Improved bounds for testing Dyck languages. SODA 2018: 1529-1544 - [c23]Raphaël Clifford, Allan Grønlund, Kasper Green Larsen, Tatiana Starikovskaya:
Upper and Lower Bounds for Dynamic Data Structures on Strings. STACS 2018: 22:1-22:14 - [i18]Raphaël Clifford, Allan Grønlund, Kasper Green Larsen, Tatiana Starikovskaya:
Upper and lower bounds for dynamic data structures on strings. CoRR abs/1802.06545 (2018) - [i17]Pawel Gawrychowski, Gad M. Landau, Tatiana Starikovskaya:
Fast entropy-bounded string dictionary look-up with mismatches. CoRR abs/1806.09646 (2018) - [i16]Pawel Gawrychowski, Tatiana Starikovskaya:
Streaming dictionary matching with mismatches. CoRR abs/1809.02517 (2018) - [i15]Vincent Cohen-Addad, Laurent Feuilloley, Tatiana Starikovskaya:
Lower bounds for text indexing with mismatches and differences. CoRR abs/1812.09120 (2018) - 2017
- [c22]Tatiana Starikovskaya:
Communication and Streaming Complexity of Approximate Pattern Matching. CPM 2017: 13:1-13:11 - [c21]Jakub Radoszewski, Tatiana Starikovskaya:
Streaming K-Mismatch with Error Correcting and Applications. DCC 2017: 290-299 - [i14]Eldar Fischer, Frédéric Magniez, Tatiana Starikovskaya:
Improved bounds for testing Dyck languages. CoRR abs/1707.06606 (2017) - [i13]Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya:
Longest common substring with approximately k mismatches. CoRR abs/1712.08573 (2017) - 2016
- [j4]Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Ignat I. Kolesnichenko, Tatiana Starikovskaya:
Computing minimal and maximal suffixes of a substring. Theor. Comput. Sci. 638: 112-121 (2016) - [c20]Tatiana Starikovskaya:
Longest Common Substring with Approximately k Mismatches. CPM 2016: 21:1-21:11 - [c19]Raphaël Clifford, Tatiana Starikovskaya:
Approximate Hamming Distance in a Stream. ICALP 2016: 20:1-20:14 - [c18]Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya:
The k-mismatch problem revisited. SODA 2016: 2039-2052 - [c17]Raphaël Clifford, Allyx Fontaine, Tatiana Starikovskaya, Hjalte Wedel Vildhøj:
Dynamic and Approximate Pattern Matching in 2D. SPIRE 2016: 133-144 - [i12]Raphaël Clifford, Tatiana Starikovskaya:
Approximate Hamming distance in a stream. CoRR abs/1602.07241 (2016) - [i11]Jakub Radoszewski, Tatiana Starikovskaya:
Streaming k-mismatch with data recovery and applications. CoRR abs/1607.05626 (2016) - 2015
- [j3]Tatiana Starikovskaya, Hjalte Wedel Vildhøj:
A suffix tree or not a suffix tree? J. Discrete Algorithms 32: 14-23 (2015) - [c16]Alexander Loptev, Gregory Kucherov, Tatiana Starikovskaya:
On Maximal Unbordered Factors. CPM 2015: 343-354 - [c15]Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya:
Dictionary Matching in a Stream. ESA 2015: 361-372 - [c14]Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya:
Wavelet Trees Meet Suffix Trees. SODA 2015: 572-591 - [c13]Pawel Gawrychowski, Gregory Kucherov, Benjamin Sach, Tatiana Starikovskaya:
Computing the Longest Unbordered Substring. SPIRE 2015: 246-257 - [i10]Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya:
Dictionary matching in a stream. CoRR abs/1504.06242 (2015) - [i9]Gregory Kucherov, Alexander Loptev, Tatiana Starikovskaya:
On Maximal Unbordered Factors. CoRR abs/1504.07406 (2015) - [i8]Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya:
The k-mismatch problem revisited. CoRR abs/1508.00731 (2015) - 2014
- [j2]Tsvi Kopelowitz, Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya:
Cross-document pattern matching. J. Discrete Algorithms 24: 40-47 (2014) - [c12]Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya:
Computing Minimal and Maximal Suffixes of a Substring Revisited. CPM 2014: 30-39 - [c11]Tomasz Kociumaka, Tatiana Starikovskaya, Hjalte Wedel Vildhøj:
Sublinear Space Algorithms for the Longest Common Substring Problem. ESA 2014: 605-617 - [c10]Tatiana Starikovskaya, Hjalte Wedel Vildhøj:
A Suffix Tree Or Not a Suffix Tree? IWOCA 2014: 338-350 - [c9]Alexander Loptev, Anna Selugina, Tatiana Starikovskaya:
Simple and Efficient String Algorithms for Query Suggestion Metrics Computation. SPIRE 2014: 268-278 - [i7]Tatiana Starikovskaya, Hjalte Wedel Vildhøj:
A Suffix Tree Or Not A Suffix Tree? CoRR abs/1403.1364 (2014) - [i6]Tomasz Kociumaka, Tatiana Starikovskaya, Hjalte Wedel Vildhøj:
Sublinear Space Algorithms for the Longest Common Substring Problem. CoRR abs/1407.0522 (2014) - [i5]Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya:
Wavelet Trees Meet Suffix Trees. CoRR abs/1408.6182 (2014) - 2013
- [c8]Maxim A. Babenko, Ignat I. Kolesnichenko, Tatiana Starikovskaya:
On Minimal and Maximal Suffixes of a Substring. CPM 2013: 28-37 - [c7]Tatiana Starikovskaya, Hjalte Wedel Vildhøj:
Time-Space Trade-Offs for the Longest Common Substring Problem. CPM 2013: 223-234 - [c6]Pawel Gawrychowski, Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya:
Minimal Discriminating Words Problem Revisited. SPIRE 2013: 129-140 - [i4]Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya:
Substring Suffix Selection. CoRR abs/1309.5618 (2013) - 2012
- [c5]Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya:
Cross-Document Pattern Matching. CPM 2012: 196-207 - [c4]Tatiana Starikovskaya:
Computing Lempel-Ziv Factorization Online. MFCS 2012: 789-799 - [c3]Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya:
Computing Discriminating and Generic Words. SPIRE 2012: 307-317 - [i3]Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya:
Cross-Document Pattern Matching. CoRR abs/1202.4076 (2012) - [i2]Tatiana Starikovskaya:
Computing Lempel-Ziv Factorization Online. CoRR abs/1202.5233 (2012) - 2011
- [j1]Maxim A. Babenko, Tatiana Starikovskaya:
Computing the longest common substring with one mismatch. Probl. Inf. Transm. 47(1): 28-33 (2011) - [c2]Roman Kolpakov, Gregory Kucherov, Tatiana Starikovskaya:
Pattern Matching on Sparse Suffix Trees. CCP 2011: 92-97 - [i1]Roman Kolpakov, Gregory Kucherov, Tatiana Starikovskaya:
Linear pattern matching on sparse suffix trees. CoRR abs/1103.2613 (2011)
2000 – 2009
- 2008
- [c1]Maxim A. Babenko, Tatiana Starikovskaya:
Computing Longest Common Substrings Via Suffix Arrays. CSR 2008: 64-75
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-13 23:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
