Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Starikovskaya, Tatiana"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computing minimal and maximal suffixes of a substring revisited
Maxim Babenko
,
PaweĈ Gawrychowski
,
Tomasz Kociumaka
,
Tatiana Starikovskaya
Lecture Notes in Computer Science
8486
, 2014, pp. 30-39
Sublinear space algorithms for the longest common substring problem
Tomasz Kociumaka
,
Tatiana Starikovskaya
,
Hjalte Wedel Vildhj
Lecture Notes in Computer Science
8737
, 2014, pp. 605-617
On minimal and maximal suffixes of a substring
Maxim Babenko
,
Ignat Kolesnichenko
,
Tatiana Starikovskaya
Lecture Notes in Computer Science
7922
, 2013, pp. 28-37
Time-space trade-offs for the longest common substring problem
Tatiana Starikovskaya
,
Hjalte Wedel Vildhj
Lecture Notes in Computer Science
7922
, 2013, pp. 223-234
Cross-document pattern matching
Gregory Kucherov
,
Yakov Nekrich
,
Tatiana Starikovskaya
Lecture Notes in Computer Science
7354
, 2012, pp. 196-207
Computing Lempel-Ziv factorization online
Tatiana Starikovskaya
Lecture Notes in Computer Science
7464
, 2012, pp. 789-799