Constructing Huffman Trees in Parallel
From MaRDI portal
Publication:4862791
DOI10.1137/S0097539792233245zbMATH Open0841.68037OpenAlexW2020600762MaRDI QIDQ4862791FDOQ4862791
Authors: Lawrence L. Larmore, Teresa Przytycka 
Publication date: 25 February 1996
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539792233245
Recommendations
- Approximating Huffman codes in parallel
- scientific article; zbMATH DE number 2086676
- Parallel construction of succinct trees
- Parallelized Huffman and Hu-Tucker searching
- scientific article; zbMATH DE number 4047160
- Constructing binary Huffman tree
- OPTIMAL PARALLEL ENCODING AND DECODING ALGORITHMS FOR TREES
- Parallel algorithms for tree accumulations
Cited In (12)
- In-place calculation of minimum-redundancy codes
- ARITHMETIC CODING IN PARALLEL
- Approximating Huffman codes in parallel
- A fast and space-economical algorithm for length-limited coding
- Huffman coding with non-sorted frequencies
- Optimal binary search trees
- Parallel Huffman Decoding with Applications to JPEG Files
- Parallel Lempel Ziv coding
- Constructing binary Huffman tree
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Constructing Huffman Trees in Parallel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4862791)
