The following pages link to Tree compression with top trees (Q2347804):
Displayed 14 items.
- Approximation of smallest linear tree grammar (Q342719) (← links)
- Constant-time tree traversal and subtree equality check for grammar-compressed trees (Q724220) (← links)
- Constant delay traversal of grammar-compressed graphs with bounded rank (Q776844) (← links)
- Tree compression using string grammars (Q1742370) (← links)
- Top tree compression of tries (Q2067669) (← links)
- Balancing straight-line programs for strings and trees (Q2106614) (← links)
- Compressed range minimum queries (Q2297849) (← links)
- Constructing small tree grammars and small circuits for formulas (Q2396826) (← links)
- Size-optimal top dag compression (Q2414042) (← links)
- Slowing Down Top Trees for Better Worst-Case Compression (Q5140780) (← links)
- Tight Bounds for Top Tree Compression (Q5150922) (← links)
- Grammar-based compression of unranked trees (Q5915574) (← links)
- (Q6065455) (← links)
- Random access in persistent strings and segment selection (Q6174650) (← links)