| Constructing Trees in Parallel (1989) | |||||||||||||||||
Abstract | |||||||||||||||||
| 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 reduced to O(logn(log log n) ) on a CRCW model, using only n processors. Also presented is an optimal O(log n) time, O(n= log n) processor EREW parallel algorithm for constructing a tree given a list of leaf depths when the depths are monotonic. | |||||||||||||||||
Publication details | |||||||||||||||||
| |||||||||||||||||