Constructing Huffman Trees in Parallel

DOI10.1137/S0097539792233245MaRDI QIDQ4862791zbMATHOpenAlexFDO

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

zbMATH Keywords

Huffman coding problemCLWS problemconcave least weight subsequence

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

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)

• Constructing binary Huffman tree
• Optimal binary search trees
• In-place calculation of minimum-redundancy codes
• ARITHMETIC CODING IN PARALLEL
• Approximating Huffman codes in parallel
• Huffman coding with non-sorted frequencies
• Parallel Huffman Decoding with Applications to JPEG Files
• Parallel Lempel Ziv coding
• A fast and space-economical algorithm for length-limited coding
• scientific article; zbMATH DE number 2086676 (Why is no real title available?)
• scientific article; zbMATH DE number 1555968 (Why is no real title available?)
• scientific article; zbMATH DE number 4049549 (Why is no real title available?)

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)