Pages that link to "Item:Q5150922"
From MaRDI portal
The following pages link to Tight Bounds for Top Tree Compression (Q5150922):
Displaying 11 items.
- XML compression via directed acyclic graphs (Q269349) (← links)
- Top tree compression of tries (Q2067669) (← links)
- Balancing straight-line programs for strings and trees (Q2106614) (← links)
- Tree compression with top trees (Q2347804) (← links)
- Size-optimal top dag compression (Q2414042) (← links)
- Compression of Unordered XML Trees (Q3174911) (← links)
- TREE COMPRESSION AND OPTIMIZATION WITH APPLICATIONS (Q3210891) (← links)
- Lossless Compression of Binary Trees With Correlated Vertex Names (Q4682896) (← links)
- Slowing Down Top Trees for Better Worst-Case Compression (Q5140780) (← links)
- Compressing branch-and-bound trees (Q6086013) (← links)
- Slowing down top trees for better worst-case compression (Q6614009) (← links)