The following pages link to (Q3280457):
Displaying 9 items.
- An approximation algorithm for binary searching in trees (Q633849) (← links)
- Dynamic Shannon coding (Q845979) (← links)
- The \(S\)-digraph optimization problem and the greedy algorithm (Q1019296) (← links)
- Finite codes and groupoid words (Q1178037) (← links)
- Optimal point-to-point broadcast algorithms via lopsided trees (Q1296579) (← links)
- Prefix codes: Equiprobable words, unequal letter costs (Q4632460) (← links)
- A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs (Q4645183) (← links)
- Approximation Algorithms for Key Management in Secure Multicast (Q5323059) (← links)
- More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding (Q5387768) (← links)
