Approximating Huffman Codes in Parallel
Authors:
- 25 June 2002
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 845-855
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Decoding of canonical Huffman codes with look-up tables2002
- Byte-oriented decoding of canonical Huffman codes2002
- Sorting in Linear Time?Journal of Computer and System Sciences, 1998
- Constructing Huffman Trees in ParallelSIAM Journal on Computing, 1995
- Improved deterministic parallel integer sortingInformation and Computation, 1991
- Parallel Merge SortSIAM Journal on Computing, 1988
- Towards optimal parallel bucket sortingInformation and Computation, 1987
- The construction of Huffman-equivalent prefix code in NCACM SIGACT News, 1987
- Parallel tree contraction and its application1985
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952