Pages that link to "Item:Q3210891"
From MaRDI portal
The following pages link to TREE COMPRESSION AND OPTIMIZATION WITH APPLICATIONS (Q3210891):
Displaying 12 items.
- Algorithmic height compression of unordered trees (Q304776) (← links)
- Functional programs as compressed data (Q526441) (← links)
- Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates (Q846172) (← links)
- Encoding trees by linear recurrence sequences (Q1699391) (← links)
- Tree compression with top trees (Q2347804) (← links)
- Succinct Representations of Ordinal Trees (Q2848982) (← links)
- Greedy compression systems (Q3979268) (← links)
- Generating binary trees in A-order from codewords defined on a four-letter alphabet (Q4321109) (← links)
- Efficient Statistical Modeling for the Compression of Tree Structured Intermediate Code (Q4474739) (← links)
- Slowing Down Top Trees for Better Worst-Case Compression (Q5140780) (← links)
- (Q5417722) (← links)
- Compressing branch-and-bound trees (Q6086013) (← links)