Pages that link to "Item:Q1342505"
From MaRDI portal
The following pages link to Optimal search trees using two-way key comparisons (Q1342505):
Displaying 14 items.
- Generalized binary split trees (Q794439) (← links)
- Optimal worst case trees (Q1101234) (← links)
- Optimal search trees using two-way key comparisons (Q1342505) (← links)
- Efficient multiway radix search trees (Q1350102) (← links)
- Optimal binary search trees with costs depending on the access paths. (Q1401195) (← links)
- On the cost of unsuccessful searches in search trees with two-way comparisons (Q2051772) (← links)
- On Huang and Wong's algorithm for generalized binary split trees (Q2089746) (← links)
- Digital access to comparison-based tree data structures and algorithms (Q2746435) (← links)
- Optimal Search Trees with 2-Way Comparisons (Q3459851) (← links)
- Statistical optimization of octree searches (Q3531494) (← links)
- Optimal Key Tree Structure for Deleting Two or More Leaves (Q3596708) (← links)
- Use of Doubly Chained Tree Structures in File Organisation for Optimal Searching (Q3714491) (← links)
- Efficient search algorithm on compact S-trees (Q4216183) (← links)
- A tight threshold bound for search trees with 2-way comparisons (Q6636072) (← links)