I/O efficient dynamic data structures for longest prefix queries (Q1939656)

From MaRDI portal
Revision as of 17:37, 21 March 2024 by Maintenance script (talk | contribs) (rollbackEdits.php mass rollback)
scientific article
Language Label Description Also known as
English
I/O efficient dynamic data structures for longest prefix queries
scientific article

    Statements

    title
    I/O efficient dynamic data structures for longest prefix queries (English)
    0 references
    author
    Moshe Hershcovitch
    0 references
    Haim Kaplan
    0 references
    published in
    Algorithmica
    0 references
    publication date
    5 March 2013
    0 references
    Mathematics Subject Classification ID
    68P05
    0 references
    68W32
    0 references
    05C05
    0 references
    68R10
    0 references
    zbMATH DE Number
    6141197
    0 references
    zbMATH Keywords
    algorithms
    0 references
    data structures
    0 references
    longest prefix
    0 references
    I/O model
    0 references
    segment tree
    0 references
    string B-tree
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1939656&oldid=33117893"
    Powered by MediaWiki