scientific article; zbMATH DE number 3558968

MaRDI QIDQ4131006zbMATH OpenFDO

Authors J. Van Leeuwen

Publication date 1976

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(13)

• Minimax trees in linear time with applications
• Optimal Skeleton Huffman Trees Revisited
• In-place calculation of minimum-redundancy codes
• Approximating Huffman codes in parallel
• Exact and approximation algorithms for error-detecting even codes
• Optimal prefix codes with fewer distinct codeword lengths are faster to construct
• Is Huffmann coding dead?
• Practical algorithms for generating a random ordering of the elements of a weighted set
• Huffman's algorithm via algebra
• Huffman coding with non-sorted frequencies
• Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees
• A fast and space-economical algorithm for length-limited coding
• Trees with exponentially growing costs

This page was built for publication:

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