Fast Compressed Tries through Path Decompositions (Q2828185): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GitHub / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: succinct / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1145/2656332 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000568570 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Trees in Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and practice of monotone minimal perfect hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing trees of higher degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact dictionaries for variable-length keys and data with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cache-oblivious string dictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Compact Web Graph Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Representations of Binary Trees for Range Minimum Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Storage and Retrieval by Content and Address of Static Files / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal codeword sets and representations of the integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The string B-tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressing and indexing labeled trees, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ultra-succinct representation of ordered trees with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4369384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3393339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Representation of Balanced Parentheses and Static Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Entropy-Compressed Rank/Select Dictionary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank

Latest revision as of 19:50, 12 July 2024

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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references