A simple optimal representation for balanced parentheses (Q859854): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Representing trees of higher degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental study of a compressed index / 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: Q5501236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Dictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space Efficient Suffix Trees / 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: Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828936 / rank
 
Normal rank

Latest revision as of 11:47, 25 June 2024

scientific article
Language Label Description Also known as
English
A simple optimal representation for balanced parentheses
scientific article

    Statements

    A simple optimal representation for balanced parentheses (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 January 2007
    0 references
    succinct data structures
    0 references
    parentheses representation of trees
    0 references
    compressed dictionaries
    0 references
    XML DOM
    0 references

    Identifiers