Optimal Computer Search Trees and Variable-Length Alphabetical Codes
From MaRDI portal
Recommendations
Cited in
(67)- Compressed depth sequences
- The \(S\)-digraph optimization problem and the greedy algorithm
- An extended result of Kleitman and Saks concerning binary trees
- Optimum multiway search trees
- Binary search trees in secondary memory
- Huffman's algorithm via algebra
- Testing the optimality of alphabetic trees
- Asymptotic analysis of dichotomous search with search and travel costs
- On optimal nested group testing algorithms
- Heuristics for optimum binary search trees and minimum weight triangulation problems
- Optimal binary trees with order constraints
- Monotonicity and efficient computation of optimal dichotomous search
- Huffman algebras for independent random variables
- The optimal binary search tree for Andersson's search algorithm
- Dynamic programming and graph optimization problems
- On polychotomous search problems
- Search problems: One, two or many rounds
- Correctness of constructing optimal alphabetic trees revisited
- Optimal binary search trees with costs depending on the access paths.
- Operations research applications of dichotomous search
- The cost of a class of optimal binary trees
- On the cost of unsuccessful searches in search trees with two-way comparisons
- On the Huffman and alphabetic tree problem with general cost functions
- Accelerated partial decoding in wavelet trees
- On binary search trees
- A unified access bound on comparison-based dynamic dictionaries
- Least upper bound on the cost of optimum binary search trees
- Bounds on the weighted path length of binary trees
- Generalized Huffman tree and its application in Chinese character coding
- Remark on ``Algorithm 673: Dynamic Huffman coding
- Optimal alphabetic trees for binary search
- Efficient Construction of Near-Optimal Binary and Multiway Search Trees
- Computationally Optimal Metric-First Code Tree Search Algorithms
- scientific article; zbMATH DE number 4210044 (Why is no real title available?)
- Reflections on Optimal and Nearly Optimal Binary Search Trees
- Use of Doubly Chained Tree Structures in File Organisation for Optimal Searching
- scientific article; zbMATH DE number 4062608 (Why is no real title available?)
- Optimality of right leaning trees
- Minimum Delay Codes
- Set Orderings Requiring Costliest Alphabetic Binary Trees
- A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees
- The estimated cost of a search tree on binary words
- Bounding the depth of search trees
- The Optimal Alphabetic Tree problem revisited
- Optimal versus randomized search of fixed length binary words
- Improved approximation algorithms for the average-case tree searching problem
- Dynamic Trees with Almost-Optimal Access Cost
- An optimal, purely functional implementation of the Garsia-Wachs algorithm
- Algorithms – ESA 2005
- Path Length of Binary Search Trees
- A New Proof of the T-C Algorithm
- Revisiting Nested Group Testing Procedures: New Results, Comparisons, and Robustness
- Algorithms
- Optimal binary search trees
- Efficient and compact representations of some non-canonical prefix-free codes
- On the complexity of searching in trees and partially ordered structures
- Optimum alphabetic binary trees
- Decision trees with short explainable rules
- Old and new results on alphabetic codes
- Tight approximation bounds on a simple algorithm for minimum average search time in trees
- Adaptive shivers sort: an alternative sorting algorithm
- Galloping in fast-growth natural merge sorts
- Lempel-Ziv-78 compressed string dictionaries
- Optimal alphabetic binary tree for a nonregular cost function
- On the redundancy of D-ary Fano codes
- A binary decision algorithm
- Trees with exponentially growing costs
This page was built for publication: Optimal Computer Search Trees and Variable-Length Alphabetical Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5636753)
