Succinct Representations of Ordinal Trees (Q2848982): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W165200395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct indexes for strings, binary relations and multilabeled trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing trees of higher degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding level-ancestors in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Access to Grammar-Compressed Strings and Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderly Spanning Trees with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering the LOUDS Succinct Tree Representation / 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: Succinct representation of dynamic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Succinct Representations of Trees? / 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: The cell probe complexity of succinct data structures / 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: A simple optimal representation for balanced parentheses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encoding 2D range maximum queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of Succinct Indices / 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: Ultra-succinct representation of ordered trees with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: TREE COMPRESSION AND OPTIMIZATION WITH APPLICATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced parentheses strike back / 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: Space Efficient Suffix Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / 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: Q4449188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-adjusting binary search trees / rank
 
Normal rank

Latest revision as of 20:34, 6 July 2024

scientific article
Language Label Description Also known as
English
Succinct Representations of Ordinal Trees
scientific article

    Statements

    Succinct Representations of Ordinal Trees (English)
    0 references
    0 references
    0 references
    13 September 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers