The complexity of computing maximal word functions (Q1321032)

From MaRDI portal
Revision as of 01:34, 14 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/cc/AllenderBP93, #quickstatements; #temporary_batch_1731543907597)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of computing maximal word functions
scientific article

    Statements

    title
    The complexity of computing maximal word functions (English)
    0 references
    author
    Danilo Bruschi
    0 references
    Giovanni Pighizzini
    0 references
    Eric W. Allender
    0 references
    publication date
    8 May 1994
    0 references
    zbMATH Keywords
    data retrieval
    0 references
    ranking
    0 references
    data compression
    0 references
    parallel algorithm
    0 references
    maximal word functions
    0 references
    one-way nondeterministic auxiliary pushdown automata
    0 references
    cites work
    P-Printable Sets
    0 references
    Q4201936
    0 references
    Q3862379
    0 references
    Q4385522
    0 references

    Identifiers

    DOI
    10.1007/BF01275489
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68Q45
    0 references
    68Q15
    0 references
    68W15
    0 references
    68P20
    0 references
    68P25
    0 references
    zbMATH DE Number
    561485
    0 references
    Wikidata QID
    Q61677541
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1321032&oldid=37911793"
    Powered by MediaWiki