scientific article; zbMATH DE number 3558968
From MaRDI portal
Publication:4131006
zbMath0358.68065MaRDI QIDQ4131006
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Algorithms in computer science (68W99)
Related Items (12)
Optimal Skeleton Huffman Trees Revisited ⋮ In-place calculation of minimum-redundancy codes ⋮ Exact and approximation algorithms for error-detecting even codes ⋮ Huffman's algorithm via algebra ⋮ Trees with exponentially growing costs ⋮ Practical algorithms for generating a random ordering of the elements of a weighted set ⋮ Approximating Huffman codes in parallel ⋮ Is Huffmann coding dead? ⋮ Huffman coding with non-sorted frequencies ⋮ Minimax trees in linear time with applications ⋮ Optimal prefix codes with fewer distinct codeword lengths are faster to construct ⋮ Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees
This page was built for publication:
