Constructing Trees in Parallel (1989)
M. J. Atallah, S. R. Kosaraju, L. L. Larmore, G. L. Miller, S-H. Teng
O(log = log n processor as well as O(log n) = log n processor CREW deterministic parallel algorithms are presented for constructing Huffman codes from a given list of frequencies. The time can be...