Optimal Computer Search Trees and Variable-Length Alphabetical Codes
From MaRDI portal
Publication:5636753
DOI10.1137/0121057zbMath0228.94002OpenAlexW2065954102WikidataQ56049308 ScholiaQ56049308MaRDI QIDQ5636753
No author found.
Publication date: 1971
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0121057
algorithmcomputer search procedureconstruction of alphabetic binary tree of minimum weighted path length
Related Items (44)
Dynamic programming and graph optimization problems ⋮ Set Orderings Requiring Costliest Alphabetic Binary Trees ⋮ On polychotomous search problems ⋮ On binary search trees ⋮ On the redundancy of \(D\)-ary Fano codes ⋮ Optimal alphabetic trees for binary search ⋮ Search problems: One, two or many rounds ⋮ A unified access bound on comparison-based dynamic dictionaries ⋮ Efficient Construction of Near-Optimal Binary and Multiway Search Trees ⋮ Operations research applications of dichotomous search ⋮ Correctness of constructing optimal alphabetic trees revisited ⋮ Optimum multiway search trees ⋮ 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 ⋮ Huffman's algorithm via algebra ⋮ On the complexity of searching in trees and partially ordered structures ⋮ Improved approximation algorithms for the average-case tree searching problem ⋮ The Optimal Alphabetic Tree problem revisited ⋮ Algorithms ⋮ Testing the optimality of alphabetic trees ⋮ Dynamic Trees with Almost-Optimal Access Cost ⋮ Asymptotic analysis of dichotomous search with search and travel costs ⋮ On the Huffman and alphabetic tree problem with general cost functions ⋮ Optimal binary search trees ⋮ Lempel-Ziv-78 compressed string dictionaries ⋮ Efficient and compact representations of some non-canonical prefix-free codes ⋮ Compressed depth sequences ⋮ Accelerated partial decoding in wavelet trees ⋮ On optimal nested group testing algorithms ⋮ On the cost of unsuccessful searches in search trees with two-way comparisons ⋮ Heuristics for optimum binary search trees and minimum weight triangulation problems ⋮ The \(S\)-digraph optimization problem and the greedy algorithm ⋮ Reflections on Optimal and Nearly Optimal Binary Search Trees ⋮ Least upper bound on the cost of optimum binary search trees ⋮ Optimal binary trees with order constraints ⋮ Bounds on the weighted path length of binary trees ⋮ The cost of a class of optimal binary trees ⋮ Monotonicity and efficient computation of optimal dichotomous search ⋮ An extended result of Kleitman and Saks concerning binary trees ⋮ Optimal alphabetic binary tree for a nonregular cost function ⋮ Huffman algebras for independent random variables ⋮ Revisiting Nested Group Testing Procedures: New Results, Comparisons, and Robustness ⋮ The optimal binary search tree for Andersson's search algorithm
This page was built for publication: Optimal Computer Search Trees and Variable-Length Alphabetical Codes
