A work-time optimal algorithm for computing all string covers (Q671438)

From MaRDI portal
Revision as of 10:46, 29 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q1754030)
scientific article
Language Label Description Also known as
English
A work-time optimal algorithm for computing all string covers
scientific article

    Statements

    title
    A work-time optimal algorithm for computing all string covers (English)
    0 references
    publication date
    27 February 1997
    0 references
    zbMATH DE Number
    983302
    0 references
    zbMATH Keywords
    repetitive structures of strings
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q671438&oldid=23809232"
    Powered by MediaWiki