Ultra-succinct representation of ordered trees
From MaRDI portal
Recommendations
Cited in
(28)- Succinct oblivious RAM
- Succinct representation of labeled trees
- Ultra-succinct representation of ordered trees with applications
- Space-efficient construction of Lempel-Ziv compressed text indexes
- New common ancestor problems in trees and directed acyclic graphs
- A uniform paradigm to succinctly encode various families of trees
- Dynamic Succinct Ordered Trees
- Dualities in tree representations
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations
- A simple storage scheme for strings achieving entropy bounds
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations
- Combinatorial Pattern Matching
- GLOUDS: representing tree-like graphs
- Representation of ordered trees with a given degree distribution
- Succinct dynamic cardinal trees with constant time operations for small alphabet
- Succinct representations of ordinal trees
- Short Transitive Signatures for Directed Trees
- Succinct representation of labeled graphs
- Adaptive searching in succinctly encoded binary relations and tree-structured documents
- A Framework for Succinct Labeled Ordinal Trees over Large Alphabets
- Succinct representations of weighted trees supporting path queries
- Stronger Lempel-Ziv based compressed text indexing
- Succinct representation of balanced parentheses and static trees
- On compact representations of all-pairs-shortest-path-distance matrices
- Universal Succinct Representations of Trees?
- On succinct representations of binary trees
- A Uniform Approach Towards Succinct Representation of Trees
- Simple and efficient fully-functional succinct trees
This page was built for publication: Ultra-succinct representation of ordered trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934640)
