The following pages link to Grammar-Based Tree Compression (Q3451087):
Displaying 15 items.
- Parameter reduction and automata evaluation for grammar-compressed trees (Q440015) (← links)
- Leaf languages and string compression (Q550251) (← links)
- Constant delay traversal of grammar-compressed graphs with bounded rank (Q776844) (← links)
- Tree compression using string grammars (Q1742370) (← links)
- Learning from Łukasiewicz and Meredith: investigations into proof structures (Q2055843) (← links)
- Balancing straight-line programs for strings and trees (Q2106614) (← links)
- On stricter reachable repetitiveness measures (Q2146140) (← links)
- Compressed range minimum queries (Q2297849) (← links)
- Size-optimal top dag compression (Q2414042) (← links)
- Inter-procedural Two-Variable Herbrand Equalities (Q2802449) (← links)
- Grammar-Based Compression in a Streaming Model (Q3564868) (← links)
- Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars (Q4608715) (← links)
- (Q4994134) (← links)
- Grammar-based compression of unranked trees (Q5915574) (← links)
- Investigations into proof structures (Q6653096) (← links)