Optimal Binary Search Trees with Restricted Maximal Depth

DOI10.1137/0203008MaRDI QIDQ4776875zbMATH OpenOpenAlexFDO

Authors M. R. Garey

Publication date 1974

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

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

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Information storage and retrieval of data (68P20) Theory of error-correcting codes and error-detecting codes (94B99)

Cited in

(13)

• Restructuring binary search trees revisited
• Optimal multiway search trees for variable size keys
• Optimum multiway search trees
• Optimal alphabetic search trees with restricted maximal height
• 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
• A new genetic approach to construct near-optimal binary search trees
• Optimum extensions of prefix codes.
• Optimal search trees and length restricted codes
• Optimal binary search trees
• Parallel lossless image compression using Huffman and arithmetic coding
• Old and new results on alphabetic codes

This page was built for publication: Optimal Binary Search Trees with Restricted Maximal Depth

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