TreeRePair
From MaRDI portal
Software:43870
swMATH32159MaRDI QIDQ43870FDOQ43870
Author name not available (Why is that?)
Cited In (13)
- Tree compression with top trees
- Constructing small tree grammars and small circuits for formulas
- XML compression via directed acyclic graphs
- Parameter reduction and automata evaluation for grammar-compressed trees
- Constant-time tree traversal and subtree equality check for grammar-compressed trees
- Properties of graphs specified by a regular language
- Grammar-based compression of unranked trees
- On the complexity of the smallest grammar problem over fixed alphabets
- Faster Compressed Suffix Trees for Repetitive Collections
- Approximation of smallest linear tree grammar
- Constant delay traversal of grammar-compressed graphs with bounded rank
- Properties of graphs specified by a regular language
- Tree compression using string grammars
This page was built for software: TreeRePair
