Pages that link to "Item:Q1222957"
From MaRDI portal
The following pages link to Optimal alphabetic search trees with restricted maximal height (Q1222957):
Displaying 9 items.
- Restructuring binary search trees revisited (Q1041801) (← links)
- Optimum multiway search trees (Q1138383) (← 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)
- A new genetic approach to construct near-optimal binary search trees (Q2383896) (← links)
- Optimum extensions of prefix codes. (Q2583535) (← links)
- Optimal binary search trees (Q5906917) (← links)
- Efficient and compact representations of some non-canonical prefix-free codes (Q5918490) (← links)