TreeRePair
From MaRDI portal
Cited in
(14)- XML compression via directed acyclic graphs
- Approximation of smallest linear tree grammar
- Constant delay traversal of grammar-compressed graphs with bounded rank
- Properties of graphs specified by a regular language
- On the complexity of the smallest grammar problem over fixed alphabets
- Tree compression with top trees
- Properties of graphs specified by a regular language
- Parameter reduction and automata evaluation for grammar-compressed trees
- Faster compressed suffix trees for repetitive collections
- XMill
- SDSL
- CoDe
- Constant-time tree traversal and subtree equality check for grammar-compressed trees
- Constructing small tree grammars and small circuits for formulas
This page was built for software: TreeRePair
