scientific article; zbMATH DE number 3558968
From MaRDI portal
Publication:4131006
zbMATH Open0358.68065MaRDI QIDQ4131006FDOQ4131006
Authors: J. Van Leeuwen 
Publication date: 1976
Title of this publication is not available (Why is that?)
Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)
Cited In (13)
- Is Huffmann coding dead?
- In-place calculation of minimum-redundancy codes
- Approximating Huffman codes in parallel
- Exact and approximation algorithms for error-detecting even codes
- A fast and space-economical algorithm for length-limited coding
- Huffman coding with non-sorted frequencies
- Optimal prefix codes with fewer distinct codeword lengths are faster to construct
- Huffman's algorithm via algebra
- Minimax trees in linear time with applications
- Optimal Skeleton Huffman Trees Revisited
- Practical algorithms for generating a random ordering of the elements of a weighted set
- Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees
- 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)
