Optimal Alphabetic Trees

DOI10.1137/0205002zbMATH Open0328.68040OpenAlexW1970171209MaRDI QIDQ4094387FDOQ4094387

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) Theory of error-correcting codes and error-detecting codes (94B99) Algorithms in computer science (68W99)

Cited In (17)

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