Fast Compressed Tries through Path Decompositions (Q2828185)

From MaRDI portal
Revision as of 15:59, 17 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Fast Compressed Tries through Path Decompositions
scientific article

    Statements

    Fast Compressed Tries through Path Decompositions (English)
    0 references
    0 references
    0 references
    0 references
    24 October 2016
    0 references
    0 references
    succinct data structures
    0 references
    monotone perfect hash functions
    0 references
    string dictionaries
    0 references
    tries
    0 references