Ultra-succinct representation of ordered trees with applications (Q414928): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jcss.2011.09.002 / 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.1016/j.jcss.2011.09.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973883768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing trees of higher degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderly Spanning Trees with Applications / 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: 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: Indexing compressed text / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple storage scheme for strings achieving entropy bounds / 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: Succinct ordinal trees with level-ancestor queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471381 / 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: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934640 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced parentheses strike back / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Space-Economical Suffix Tree Construction Algorithm / 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: Automata, Languages and Programming / 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: Computing and Combinatorics / 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: Time-space trade-offs for compressed suffix arrays. / 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: New text indexing functionalities of the compressed suffix arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed suffix trees with full functionality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Squeezing succinct data structures into entropy bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering a compressed suffix tree implementation / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCSS.2011.09.002 / rank
 
Normal rank

Latest revision as of 16:50, 9 December 2024

scientific article
Language Label Description Also known as
English
Ultra-succinct representation of ordered trees with applications
scientific article

    Statements

    Ultra-succinct representation of ordered trees with applications (English)
    0 references
    0 references
    0 references
    0 references
    11 May 2012
    0 references
    succinct data structure
    0 references
    ordered tree
    0 references
    tree degree entropy
    0 references
    xbw
    0 references
    compressed suffix tree
    0 references
    0 references
    0 references
    0 references

    Identifiers