Optimal Alphabetic Trees

DOI10.1137/0205002MaRDI QIDQ4094387zbMATH OpenOpenAlexFDO

Authors Alon Itai

Publication date 1976

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0205002

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99) Theory of error-correcting codes and error-detecting codes (94B99)

Cited in

(18)

• Restructuring binary search trees revisited
• Optimal multiway search trees for variable size keys
• Algorithms for minimum length partitions of polygons
• Optimum multiway search trees
• Huffman's algorithm via algebra
• Monotonicity and efficient computation of optimal dichotomous search
• Huffman algebras for independent random variables
• Operations research applications of dichotomous search
• On the Huffman and alphabetic tree problem with general cost functions
• A new genetic approach to construct near-optimal binary search trees
• On the cost of optimal alphabetic code trees with unequal letter costs
• Optimum extensions of prefix codes.
• The construction of optimal multiway search trees and the monotonicity principle
• More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
• Optimal binary search trees
• Efficient and compact representations of some non-canonical prefix-free codes
• Old and new results on alphabetic codes
• A counter example to a monotonicity property of k-d trees

This page was built for publication: Optimal Alphabetic Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4094387)