Height Restricted Optimal Binary Trees

DOI10.1137/0216070MaRDI QIDQ3801088zbMATH OpenOpenAlexFDO

Authors Lawrence L. Larmore

Publication date 1987

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

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

zbMATH Keywords

binary treeHuffman coding

Mathematics Subject Classification ID

Searching and sorting (68P10) Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Theory of error-correcting codes and error-detecting codes (94B99)

Recommendations

• A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees
• Building Optimal Binary Search Trees from Sorted Values in O(N) Time
• Algorithms and Computation
• A parallel algorithm for optimum height-limited alphabetic binary trees
• Optimal binary trees with order constraints

Cited in

(13)

• Optimal binary trees with order constraints
• Monotonicity and efficient computation of optimal dichotomous search
• Trading off worst and expected cost in decision tree problems
• On the Huffman and alphabetic tree problem with general cost functions
• Optimum extensions of prefix codes.
• FUNCTIONAL PEARL On building trees with minimum height
• scientific article; zbMATH DE number 1140073 (Why is no real title available?)
• Restructuring ordered binary trees
• scientific article; zbMATH DE number 1445337 (Why is no real title available?)
• Algorithms and Computation
• Optimum alphabetic binary trees
• Old and new results on alphabetic codes
• Binary search trees of almost optimal height

This page was built for publication: Height Restricted Optimal Binary Trees

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