Fast Compressed Tries through Path Decompositions (Q2828185)

From MaRDI portal
Revision as of 19:50, 12 July 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
Fast Compressed Tries through Path Decompositions
scientific article

    Statements

    title
    Fast Compressed Tries through Path Decompositions (English)
    0 references
    DOI
    10.1145/2656332
    0 references
    author
    Roberto Grossi
    0 references
    Giuseppe Ottaviano
    0 references
    publication date
    24 October 2016
    0 references
    zbMATH DE Number
    6642889
    0 references
    zbMATH Keywords
    succinct data structures
    0 references
    monotone perfect hash functions
    0 references
    string dictionaries
    0 references
    tries
    0 references
    describes a project that uses
    libcds
    0 references
    SDSL
    0 references
    UbiCrawler
    0 references
    Sux4J
    0 references
    GitHub
    0 references
    succinct
    0 references
    OpenAlex ID
    W2000568570
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2828185&oldid=36282286"
    Powered by MediaWiki