Partial fillup and search time in LC tries (Q4962683)

From MaRDI portal
Revision as of 01:00, 14 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6972842
Language Label Description Also known as
English
Partial fillup and search time in LC tries
scientific article; zbMATH DE number 6972842

    Statements

    Partial fillup and search time in LC tries (English)
    0 references
    0 references
    0 references
    5 November 2018
    0 references
    0 references
    digital trees
    0 references
    Poissonization
    0 references
    level-compressed tries
    0 references
    partial fillup
    0 references
    probabilistic analysis
    0 references
    strings
    0 references
    trees
    0 references