The following pages link to Optimal Alphabetic Trees (Q4094387):
Displaying 17 items.
- A counter example to a monotonicity property of k-d trees (Q789903) (← links)
- Restructuring binary search trees revisited (Q1041801) (← links)
- Optimal multiway search trees for variable size keys (Q1053461) (← links)
- Algorithms for minimum length partitions of polygons (Q1102107) (← links)
- Optimum multiway search trees (Q1138383) (← links)
- Huffman's algorithm via algebra (Q1168073) (← links)
- Monotonicity and efficient computation of optimal dichotomous search (Q1308740) (← links)
- Huffman algebras for independent random variables (Q1314848) (← links)
- Operations research applications of dichotomous search (Q1681128) (← links)
- On the Huffman and alphabetic tree problem with general cost functions (Q2249740) (← links)
- A new genetic approach to construct near-optimal binary search trees (Q2383896) (← links)
- On the cost of optimal alphabetic code trees with unequal letter costs (Q2472833) (← links)
- Optimum extensions of prefix codes. (Q2583535) (← links)
- The construction of optimal multiway search trees and the monotonicity principle (Q3901002) (← links)
- More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding (Q5387768) (← links)
- Optimal binary search trees (Q5906917) (← links)
- Efficient and compact representations of some non-canonical prefix-free codes (Q5918490) (← links)
