Optimal binary search trees
From MaRDI portal
Publication:5906917
DOI10.1016/S0304-3975(96)00320-9zbMath0893.68045OpenAlexW2004985727MaRDI QIDQ5906917
Publication date: 30 June 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00320-9
Related Items (4)
A new genetic approach to construct near-optimal binary search trees ⋮ Operations research applications of dichotomous search ⋮ Optimal binary search trees with costs depending on the access paths. ⋮ Unnamed Item
Cites Work
- Bounding the Depth of Search Trees
- Optimal Binary Search Trees with Restricted Maximal Depth
- On the Generation of Random Binary Search Trees
- On the Variance of the Height of Random Binary Search Trees
- Constructing Huffman Trees in Parallel
- Weighted Binary Trees for Concurrent Searching
- New bounds on the expected length of one-to-one codes
- How to update a balanced binary tree with a constant number of rotations
- Generating a canonical prefix encoding
- A Method for the Construction of Minimum-Redundancy Codes
- Codes based on inaccurate source probabilities
- Optimal Computer Search Trees and Variable-Length Alphabetical Codes
- Optimal Binary Identification Procedures
- Path Length of Binary Search Trees
- A New Proof of the T-C Algorithm
- Bounds for Weight Balanced Trees
- Binary Search Trees of Bounded Balance
- Upper Bounds for the Total Path Length of Binary Trees
- Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
- An optimum encoding with minimum longest code and total number of digits
- Left distance binary tree representations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimal path length of trees with known fringe
- Characteristic inequalities for binary trees
- A linear time and space algorithm for finding isomorphic subtrees of a binary tree
- Binary search trees of almost optimal height
- Analysis of the standard deletion algorithms in exact fit domain binary search trees
- Listing and counting subtrees of equal size of a binary tree
- Performances of an algorithm constructing a nearly optimal binary tree
- A taxonomy of binary tree traversals
- Improving time and space efficiency in generalized binary search trees
- Efficient selection on a binary tree
- Two algorithms for constructing a binary tree from its traversals
- Binary search trees in secondary memory
- Optimal choice of discriminators in a balanced K-D binary search tree
- Best Huffman trees
- On the costs of optimal and near-optimal binary search trees
- A loopless algorithm for generating binary tree sequences
- Testing the optimality of alphabetic trees
- An optimal algorithm for reconstructing a binary tree
- A note on the reconstruction of a binary tree from its traversals
- A note on subtrees rooted along the primary path of a binary tree
- Optimal alphabetic search trees with restricted maximal height
- A principle of independence for binary tree searching
- Nearly optimal binary search trees
- Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
- On the max-entropy rule for a binary search tree
- Dynamic weighted binary search trees
- Heuristics for optimum binary search trees and minimum weight triangulation problems
- The optimal binary search tree for Andersson's search algorithm
- New lower bounds on the cost of binary search trees
- On the redundancy achieved by Huffman codes
- Constructing a binary tree from its traversals
- Reconstructing a binary tree from its traversals in doubly logarithmic CREW time
- A parallel algorithm for optimum height-limited alphabetic binary trees
- On binary search trees
- Optimum binary search trees
- Least upper bound on the cost of optimum binary search trees
- Another representation of binary tree traversal
- A New Algorithm for Generating Binary Trees using Rotations
- An optimal insertion algorithm for one-sided height-balanced binary search trees
- A note on D-ary Huffman codes
- DYNAMIC OPTIMAL BINARY SEARCH TREE
- New bounds on the redundancy of Huffman codes
- A fast algorithm for optimal length-limited Huffman codes
- Alphabetic Minimax Trees
- A Maximally Parallel Balancing Algorithm for Obtaining Complete Balanced Binary Trees
- The analysis of a fringe heuristic for binary search trees
- Enumerating, Ranking and Unranking Binary Trees
- Alphabetic Minimax Trees of Degree at Most t
- Probabilities Related to Father-Son Distances in Binary Search Trees
- Fault tolerance and storage reduction in binary search trees
- Binary tree gray codes
- Dynamic huffman coding
- Self-adjusting binary search trees
- A new proof of the Garsia-Wachs algorithm
- Construction of optimal binary split trees in the presence of bounded access probabilities
- A subquadratic algorithm for constructing approximately optimal binary search trees
- A study of binary tree traversal algorithms and a tag-free threaded representation
- On the path length of binary trees
- Lower Bounds for Accessing Binary Search Trees with Rotations
- Pretty-printing of trees
- Concurrent manipulation of binary search trees
- Sources which maximize the choice of a Huffman coding tree
- Generalized non-recursive traversal of binary trees
- Speed-Up in Dynamic Programming
- A note on the height of binary search trees
- Multidimensional binary search trees used for associative searching
- Performance of height-balanced trees
- Optimal Alphabetic Trees
- An Analysis of Binary Search Trees Formed from Sequences of Nondistinct Keys
- Huffman codes and self-information
- A numbering system for binary trees
- An improved bound for weight-balanced tree
- A Best Possible Bound for The Weighted Path Length of Binary Search Trees
- Generating Binary Trees Lexicographically
- A New Algorithm for Minimum Cost Binary Trees
- A data structure for manipulating priority queues
- Ranking and Listing Algorithms for k-Ary Trees
- Generating t-Ary Trees Lexicographically
- Self-Organizing Binary Search Trees
- Variations on a theme by Huffman
- Dynamic Binary Search
- Binary Trees Optimum Under Various Criteria
- The Optimal Alphabetic Tree Problem Revisited
- On Rotations and the Generation of Binary Trees
- Tight Upper and Lower Bounds on the Path Length of Binary Trees
- Parallelized Huffman and Hu-Tucker searching
This page was built for publication: Optimal binary search trees
