Approximating Huffman codes in parallel

DOI10.1016/j.jda.2006.10.007zbMath1128.68115OpenAlexW2038490901MaRDI QIDQ2466011

Piotr Berman, Marek Karpinski, Yakov Nekrich

Publication date: 11 January 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.10.007

zbMATH Keywords

parallel algorithmsapproximation algorithmsHuffman codes

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Other types of codes (94B60) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Towards optimal parallel bucket sorting
• Hybridsort revisited and parallelized
• Improved deterministic parallel integer sorting
• Parallel construction of binary trees with near optimal weighted path length
• Parallelism in Comparison Problems
• Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs
• Constructing Huffman Trees in Parallel

This page was built for publication: Approximating Huffman codes in parallel