An optimal bound for path weights in Huffman trees

DOI10.1016/0020-0190(94)00069-7zbMath0942.68547OpenAlexW1983288648MaRDI QIDQ1332764

Peter Kirrinnis

Publication date: 14 August 2000

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00069-7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (1)

Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)]

Cites Work

• The Computational Complexity of Continued Fractions
• Unnamed Item
• Unnamed Item

This page was built for publication: An optimal bound for path weights in Huffman trees