A uniform paradigm to succinctly encode various families of trees (Q2441590): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1007/s00453-012-9664-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051671786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal bounds for the predecessor problem and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing trees of higher degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Catalan, Motzkin, and Riordan numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Membership in Constant Time and Almost-Minimum Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary trees having a given number of nodes with 0, 1, and 2 children / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Associate Powers and a Functional Equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact Navigation and Distance Oracles for Graphs with Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Uniform Approach Towards Succinct Representation of Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Succinct Ordered Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Succinct Representations of Trees? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct ordinal trees with level-ancestor queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Ordinal Trees Based on Tree Covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934640 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4369384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced parentheses strike back / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3333055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low Redundancy in Static Dictionaries with Constant Query Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct indexable dictionaries with applications to encoding <i>k</i> -ary trees, prefix sums and multisets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417613 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:00, 7 July 2024

scientific article
Language Label Description Also known as
English
A uniform paradigm to succinctly encode various families of trees
scientific article

    Statements

    A uniform paradigm to succinctly encode various families of trees (English)
    0 references
    0 references
    0 references
    0 references
    25 March 2014
    0 references
    succinct data structures
    0 references
    trees
    0 references
    ordered trees
    0 references
    cardinal trees
    0 references
    unordered trees
    0 references
    compact encodings
    0 references
    entropy encoding
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers