Journal of Algorithms
Height restricted optimal binary trees
SIAM Journal on Computing
SIAM Journal on Computing
A linear space algorithm for computing maximal common subsequences
Communications of the ACM
Parallel construction of trees with optimal weighted path length
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Is Huffman coding dead? (extended abstract)
SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
Technology decomposition and mapping targeting low power dissipation
DAC '93 Proceedings of the 30th international Design Automation Conference
Real-time software-based video coder for multimedia communication systems
MULTIMEDIA '93 Proceedings of the first ACM international conference on Multimedia
Restructuring ordered binary trees
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Length-restricted coding using modified probability distributions
ACSC '01 Proceedings of the 24th Australasian conference on Computer science
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Space-efficient construction of optimal prefix codes
DCC '95 Proceedings of the Conference on Data Compression
Incremental Calculation of Minimum-Redundancy Length-Restricted Codes
DCC '02 Proceedings of the Data Compression Conference
Length-Restricted Coding in Static and Dynamic Frameworks
DCC '01 Proceedings of the Data Compression Conference
Restructuring ordered binary trees
Journal of Algorithms - Special issue: SODA 2000
Resource-aware conference key establishment for heterogeneous networks
IEEE/ACM Transactions on Networking (TON)
Compression techniques for fast external sorting
The VLDB Journal — The International Journal on Very Large Data Bases
Trees with exponentially growing costs
Information and Computation
A generic top-down dynamic-programming approach to prefix-free coding
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
External sorting with on-the-fly compression
BNCOD'03 Proceedings of the 20th British national conference on Databases
IEEE Transactions on Information Theory
Exact and approximation algorithms for error-detecting even codes
Theoretical Computer Science
Solving sequential knapsack problems
Operations Research Letters
| Hi-index | 0.07 |
An O(nL)-time algorithm is introduced for constructing an optimal Huffman code for a weighted alphabet of size n, where each code string must have length no greater than L. The algorithm uses O(n) space.