Tatiana Starikovskaya

Available identifiers

zbMath Open starikovskaya.tatiana-aMaRDI QIDQ294951

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6062160	2023-10-31	Paper
Pattern matching under DTW distance	2023-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q5874289	2023-02-07	Paper
Approximating Longest Common Substring with k mismatches: Theory and Practice	2023-02-07	Paper
https://portal.mardi4nfdi.de/entity/Q5874453	2023-02-07	Paper
https://portal.mardi4nfdi.de/entity/Q5875566	2023-02-03	Paper
Streaming Dictionary Matching with Mismatches	2022-07-18	Paper
Quasi-Periodicity in Streams	2022-07-18	Paper
Streaming dictionary matching with mismatches	2022-03-22	Paper
https://portal.mardi4nfdi.de/entity/Q5005170	2021-08-04	Paper
All non-trivial variants of 3-LDT are equivalent	2021-01-19	Paper
Upper and Lower Bounds for Dynamic Data Structures on Strings	2020-08-05	Paper
Communication and Streaming Complexity of Approximate Pattern Matching	2020-05-25	Paper
Streaming \(k\)-mismatch with error correcting and applications	2020-03-12	Paper
Lower bounds for text indexing with mismatches and differences	2019-10-15	Paper
Correction to: ``Longest common substring with approximately \(k\) mismatches	2019-05-21	Paper
Longest common substring with approximately \(k\) mismatches	2019-05-17	Paper
Dynamic and approximate pattern matching in 2D	2018-10-17	Paper
The k-mismatch problem revisited	2018-07-16	Paper
https://portal.mardi4nfdi.de/entity/Q4607989	2018-03-15	Paper
Approximate Hamming Distance in a Stream	2017-12-19	Paper
Longest Common Substring with Approximately k Mismatches	2017-10-17	Paper
Wavelet Trees Meet Suffix Trees	2017-10-05	Paper
Computing minimal and maximal suffixes of a substring	2016-06-16	Paper
Dictionary Matching in a Stream	2015-11-19	Paper
Computing the Longest Unbordered Substring	2015-10-02	Paper
A suffix tree or not a suffix tree?	2015-09-15	Paper
On Maximal Unbordered Factors	2015-08-20	Paper
A suffix tree or not a suffix tree?	2015-05-04	Paper
Sublinear Space Algorithms for the Longest Common Substring Problem	2014-10-08	Paper
Cross-document pattern matching	2014-08-13	Paper
Computing Minimal and Maximal Suffixes of a Substring Revisited	2014-06-30	Paper
Minimal Discriminating Words Problem Revisited	2013-10-29	Paper
On Minimal and Maximal Suffixes of a Substring	2013-06-14	Paper
Time-Space Trade-Offs for the Longest Common Substring Problem	2013-06-14	Paper
Computing Discriminating and Generic Words	2013-04-08	Paper
Computing Lempel-Ziv Factorization Online	2012-09-25	Paper
Cross-Document Pattern Matching	2012-08-14	Paper
Computing the longest common substring with one mismatch	2012-03-13	Paper
Computing Longest Common Substrings Via Suffix Arrays	2008-06-05	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Tatiana Starikovskaya