Optimal search trees and length restricted codes

DOI10.1007/BF01931268zbMath0429.68062OpenAlexW2065827437MaRDI QIDQ3867198

No author found.

Publication date: 1979

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01931268

zbMATH Keywords

algorithmprefix codesvariable-length codesoptimal search treesdirectly executed languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Prefix, length-variable, comma-free codes (94A45) Discrete mathematics in relation to computer science (68R99)

Related Items (1)

Optimal search trees and length restricted codes

Cites Work

• Unnamed Item
• Unnamed Item
• Optimum binary search trees
• Optimal search trees and length restricted codes
• Aspects of compact programs and directly executed languages
• A Study of the Physical Structure of Algorithms
• Optimal Binary Search Trees with Restricted Maximal Depth
• Optimal variable length codes (arbitrary symbol cost and equal code word probability)

This page was built for publication: Optimal search trees and length restricted codes