The following pages link to Optimal Multi-Way Search Trees (Q3911413):
Displayed 12 items.
- A note on optimal multiway split trees (Q802863) (← links)
- On the construction of weighted time-optimal B-trees (Q911255) (← links)
- Optimal multiway search trees for variable size keys (Q1053461) (← links)
- Algorithms for minimum length partitions of polygons (Q1102107) (← links)
- Self-adjusting multi-way search trees (Q1178210) (← links)
- Heuristics for optimum binary search trees and minimum weight triangulation problems (Q1263993) (← links)
- Monotonicity and efficient computation of optimal dichotomous search (Q1308740) (← links)
- Operations research applications of dichotomous search (Q1681128) (← links)
- On the Huffman and alphabetic tree problem with general cost functions (Q2249740) (← links)
- Efficient Construction of Near-Optimal Binary and Multiway Search Trees (Q3183458) (← links)
- Optimal multiway generalized split trees (Q3989764) (← links)
- A new algorithm for the construction of optimal B-trees (Q5056165) (← links)