Optimum binary search trees
From MaRDI portal
Publication:2551314
DOI10.1007/BF00264289zbMath0233.68010WikidataQ106465489 ScholiaQ106465489MaRDI QIDQ2551314
Publication date: 1971
Published in: Acta Informatica (Search for Journal in Brave)
Related Items
Dynamic programming and graph optimization problems, Richard Bellman's contributions to computer science, Optimal sequential file search, Average complexity of searching for identical objects in random nonuniform databases, On the redundancy of \(D\)-ary Fano codes, A new algorithm for the construction of optimal B-trees, Functional Pearls, A unified access bound on comparison-based dynamic dictionaries, Practical distribution-sensitive point location in triangulations, A new genetic approach to construct near-optimal binary search trees, Proximate point searching, Speeding up dynamic programming with applications to molecular biology, Speeding up the AIFV-2 dynamic programs by two orders of magnitude using range minimum queries, Category-based routing in social networks: membership dimension and the small-world phenomenon, Operations research applications of dichotomous search, On a sublinear time parallel construction of optimal binary search trees, Optimal sequential file search: A reduced-state dynamic programming approach, Correctness of constructing optimal alphabetic trees revisited, Optimum multiway search trees, Robust aggregation of compositional and interval-valued data: the mode on the unit simplex, Optimal binary search trees with costs depending on the access paths., Binary search trees in secondary memory, An optimal, purely functional implementation of the Garsia–Wachs algorithm, Offline Drawing of Dynamic Trees: Algorithmics and Document Integration, Classification via two-way comparisons (extended abstract), Toward a model for backtracking and dynamic programming, Some remarks on the construction of optimal codes, Construction of a tree from its traversals in optimal time and space, Extensions of dynamic programming for multi-stage combinatorial optimization, On the construction of weighted time-optimal B-trees, Dynamic Trees with Almost-Optimal Access Cost, Dynamic programming with convexity, concavity and sparsity, On the Huffman and alphabetic tree problem with general cost functions, A sublinear parallel algorithm for some dynamic programming problems, The binary identification problem for weighted trees, Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying, Optimal binary search trees, Optimal binary search trees, Optimal alphabetic search trees with restricted maximal height, Optimal search trees and length restricted codes, On heuristics for minimum length rectilinear partitions, Alphabetic coding with exponential costs, Schranken für balanced trees bei ausgewogenen Verteilungen, Biased predecessor search, The power and limitations of static binary search trees with lazy finger, Efficient decision tree design for discrete variable pattern recognition problems, Dynamic weighted binary search trees, Allocating the fixed cost as a complement of other cost inputs: A DEA approach, On the cost of unsuccessful searches in search trees with two-way comparisons, Towards Efficient Fully Randomized Message-Locked Encryption, The construction of optimal multiway search trees and the monotonicity principle, Reflections on Optimal and Nearly Optimal Binary Search Trees, Least-cost partition algorithms, Least upper bound on the cost of optimum binary search trees, Bounds on the weighted path length of binary trees, Dynamic programming bi-criteria combinatorial optimization, Restructuring binary search trees revisited, A History of Distribution-Sensitive Data Structures, \(N\) degrees of separation: Influences of dynamic programming on computer science, The cost of a class of optimal binary trees, On Huang and Wong's algorithm for generalized binary split trees, A counter example to a monotonicity property of k-d trees, Optimal multiway search trees for variable size keys, Generalized binary split trees, Random Access to Grammar-Compressed Strings and Trees, A strategy for searching with different access costs., Monotonicity and efficient computation of optimal dichotomous search, Optimum extensions of prefix codes., A note on optimal multiway split trees, Competitive Online Search Trees on Trees, The optimality of balancing workloads in certain types of flexible manufacturing systems, Unnamed Item, Speed-Up in Dynamic Programming, The optimal binary search tree for Andersson's search algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Trees, Forests and Rearranging
- On the efficiency of a new method of dictionary construction
- A Linear Search Problem
- A contribution to the development of ALGOL
- An efficient context-free parsing algorithm
- Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
