A logarithmic time sort for linear size networks
Journal of the ACM (JACM)
Dynamic parallel complexity of computational circuits
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Sorting in c log n parallel steps
Combinatorica
Graph Algorithms
Constructing trees in parallel
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Parallel construction of near optimal binary trees
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Approximating Huffman Codes in Parallel
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Approximating Huffman codes in parallel
Journal of Discrete Algorithms
| Hi-index | 0.00 |
In this paper, we show that an optimal prefix code (Huffman-equivalent code) over Σ = {0,1,...,σ} for any n letters a1,...,an of frequency f1,...,fn can be constructed in O(log2n) time, using only polynomial number of processors. This is done by a uniform reduction of optimal prefix coding problem to a min-plus circuit value problem of polynomial size and linear degree. Thus we can use the parallel circuit evaluation algorithms presented in [7] and [8] to construct a time-efficient and processor-efficient parallel algorithm for optimal prefix coding problem.