Efficient parallel algorithms to test square-freeness and factorize strings (Q1178198)

From MaRDI portal
Revision as of 12:22, 15 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Efficient parallel algorithms to test square-freeness and factorize strings
scientific article

    Statements

    title
    Efficient parallel algorithms to test square-freeness and factorize strings (English)
    0 references
    author
    Wojciech Rytter
    0 references
    Maxime Crochemore
    0 references
    publication date
    26 June 1992
    0 references
    Mathematics Subject Classification ID
    68W15
    0 references
    68R05
    0 references
    68U15
    0 references
    zbMATH DE Number
    23318
    0 references
    zbMATH Keywords
    CRCW PRAM
    0 references
    OpenAlex ID
    W1990387309
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1178198&oldid=34080466"
    Powered by MediaWiki