The following pages link to Optimum binary search trees (Q2551314):
Displaying 50 items.
- Category-based routing in social networks: membership dimension and the small-world phenomenon (Q386908) (← links)
- Toward a model for backtracking and dynamic programming (Q430838) (← links)
- On heuristics for minimum length rectilinear partitions (Q582084) (← links)
- Proximate point searching (Q598552) (← links)
- Biased predecessor search (Q727976) (← links)
- The power and limitations of static binary search trees with lazy finger (Q727988) (← links)
- Dynamic programming bi-criteria combinatorial optimization (Q777429) (← links)
- A counter example to a monotonicity property of k-d trees (Q789903) (← links)
- Generalized binary split trees (Q794439) (← links)
- A note on optimal multiway split trees (Q802863) (← links)
- On the redundancy of \(D\)-ary Fano codes (Q831818) (← links)
- Construction of a tree from its traversals in optimal time and space (Q910183) (← links)
- On the construction of weighted time-optimal B-trees (Q911255) (← links)
- Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying (Q963330) (← links)
- Alphabetic coding with exponential costs (Q990132) (← links)
- Allocating the fixed cost as a complement of other cost inputs: A DEA approach (Q1011321) (← links)
- Restructuring binary search trees revisited (Q1041801) (← links)
- Optimal multiway search trees for variable size keys (Q1053461) (← links)
- The optimality of balancing workloads in certain types of flexible manufacturing systems (Q1066800) (← links)
- Richard Bellman's contributions to computer science (Q1081590) (← links)
- Speeding up dynamic programming with applications to molecular biology (Q1121182) (← links)
- Optimum multiway search trees (Q1138383) (← links)
- Binary search trees in secondary memory (Q1146005) (← links)
- Dynamic programming with convexity, concavity and sparsity (Q1190452) (← links)
- A sublinear parallel algorithm for some dynamic programming problems (Q1202931) (← links)
- Optimal alphabetic search trees with restricted maximal height (Q1222957) (← links)
- Schranken für balanced trees bei ausgewogenen Verteilungen (Q1238629) (← links)
- Efficient decision tree design for discrete variable pattern recognition problems (Q1248377) (← links)
- Dynamic weighted binary search trees (Q1253546) (← links)
- Monotonicity and efficient computation of optimal dichotomous search (Q1308740) (← links)
- The optimal binary search tree for Andersson's search algorithm (Q1323348) (← links)
- Dynamic programming and graph optimization problems (Q1327180) (← links)
- Optimal sequential file search (Q1333457) (← links)
- Optimal sequential file search: A reduced-state dynamic programming approach (Q1390221) (← links)
- Correctness of constructing optimal alphabetic trees revisited (Q1390875) (← links)
- Optimal binary search trees with costs depending on the access paths. (Q1401195) (← links)
- \(N\) degrees of separation: Influences of dynamic programming on computer science (Q1584638) (← links)
- Operations research applications of dichotomous search (Q1681128) (← links)
- The binary identification problem for weighted trees (Q1758172) (← links)
- Least-cost partition algorithms (Q1823166) (← links)
- The cost of a class of optimal binary trees (Q1844596) (← links)
- A strategy for searching with different access costs. (Q1853499) (← 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)
- Extensions of dynamic programming for multi-stage combinatorial optimization (Q2205944) (← links)
- On the Huffman and alphabetic tree problem with general cost functions (Q2249740) (← links)
- A unified access bound on comparison-based dynamic dictionaries (Q2381520) (← links)
- A new genetic approach to construct near-optimal binary search trees (Q2383896) (← links)
- Least upper bound on the cost of optimum binary search trees (Q2551315) (← links)
- Bounds on the weighted path length of binary trees (Q2559138) (← links)
