Sliding CDAWG perfection
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F08%3A00100740" target="_blank" >RIV/00216208:11320/08:00100740 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Sliding CDAWG perfection
Original language description
We answer an open problem on the complexity of maintaining Compact Directed Acyclic Word Graph for a perfect sliding window and present an online algorithm for perfect sliding with asymtotically optimal running time.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BD - Information theory
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2008
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Lecture Notes in Computer Science
ISSN
0302-9743
e-ISSN
—
Volume of the periodical
2008
Issue of the periodical within the volume
5280
Country of publishing house
DE - GERMANY
Number of pages
12
Pages from-to
109-120
UT code for WoS article
000262212000010
EID of the result in the Scopus database
—