Pages that link to "Item:Q1429270"
From MaRDI portal
The following pages link to Code and parse trees for lossless source encoding (Q1429270):
Displaying 8 items.
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- On the complexity of searching in trees and partially ordered structures (Q650925) (← links)
- The \(S\)-digraph optimization problem and the greedy algorithm (Q1019296) (← links)
- New bounds on \(D\)-ary optimal codes (Q1044733) (← links)
- On the cost of optimal alphabetic code trees with unequal letter costs (Q2472833) (← links)
- Optimal Skeleton Huffman Trees Revisited (Q5042248) (← links)
- More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding (Q5387768) (← links)
- A combinatorial approach to Golomb forests (Q5941521) (← links)