Pages that link to "Item:Q342719"
From MaRDI portal
The following pages link to Approximation of smallest linear tree grammar (Q342719):
Displaying 9 items.
- A bisection algorithm for grammar-based compression of ordered trees (Q407558) (← links)
- Constant delay traversal of grammar-compressed graphs with bounded rank (Q776844) (← links)
- Compressed range minimum queries (Q2297849) (← links)
- Constructing small tree grammars and small circuits for formulas (Q2396826) (← links)
- Approximation of smallest linear tree grammar (Q2965507) (← links)
- Constructing Small Tree Grammars and Small Circuits for Formulas (Q2978536) (← links)
- Regular Approximation of Weighted Linear Context-Free Tree Languages (Q4605512) (← links)
- Slowing Down Top Trees for Better Worst-Case Compression (Q5140780) (← links)
- Slowing down top trees for better worst-case compression (Q6614009) (← links)