An optimal bound for path weights in Huffman trees

DOI10.1016/0020-0190(94)00069-7MaRDI QIDQ1332764zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 194009 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• The Computational Complexity of Continued Fractions

Cited in

(1)

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

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

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