Towards optimal parallel bucket sorting
Information and Computation
The construction of Huffman-equivalent prefix code in NC
ACM SIGACT News
SIAM Journal on Computing
Improved deterministic parallel integer sorting
Information and Computation
Parallel construction of optimal alphabetic trees
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Constructing Huffman Trees in Parallel
SIAM Journal on Computing
Journal of Computer and System Sciences
Decoding of Canonical Huffman Codes with Look-Up Tables
DCC '00 Proceedings of the Conference on Data Compression
Parallel tree contraction and its application
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
In this paper we present new results on the approximate parallel construction of Huffman codes. Our algorithm achieves linear work and logarithmic time, provided that the initial set of elements is sorted. This is the first parallel algorithm for that problem with the optimal time and work.Combining our approach with the best known parallel sorting algorithms we can construct an almost optimal Huffman tree with optimal time and work. This also leads to the first parallel algorithm that constructs exact Huffman codes with maximum codeword length H in time O(H) and with n processors. This represents a useful improvement since most practical situations satisfy H = O(log n).