Pages that link to "Item:Q2848982"
From MaRDI portal
The following pages link to Succinct Representations of Ordinal Trees (Q2848982):
Displaying 17 items.
- Succinct posets (Q329288) (← links)
- Ultra-succinct representation of ordered trees with applications (Q414928) (← links)
- Succinct representation of labeled trees (Q476876) (← links)
- A framework for succinct labeled ordinal trees over large alphabets (Q487027) (← links)
- Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs (Q2150567) (← links)
- On succinct representations of binary trees (Q2363992) (← links)
- Constructing small tree grammars and small circuits for formulas (Q2396826) (← links)
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) (← links)
- Parallel construction of succinct trees (Q2410360) (← links)
- Faster repetition-aware compressed suffix trees based on block trees (Q2672222) (← links)
- Random Access to High-Order Entropy Compressed Text (Q2848976) (← links)
- Succinct Data Structures ... Potential for Symbolic Computation? (Q2985800) (← links)
- A Uniform Approach Towards Succinct Representation of Trees (Q3512457) (← links)
- A Framework for Succinct Labeled Ordinal Trees over Large Alphabets (Q4909570) (← links)
- New Computational Paradigms (Q5717041) (← links)
- Faster repetition-aware compressed suffix trees based on block trees (Q6536270) (← links)
- Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs (Q6610090) (← links)