Pages that link to "Item:Q2848982"
From MaRDI portal
The following pages link to Succinct Representations of Ordinal Trees (Q2848982):
Displayed 7 items.
- 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)