Constructing Trees in Parallel (1989)
by
M. J. Atallah
,
S. R. Kosaraju
,
L. L. Larmore
,
G. L. Miller
,
S-H. Teng
| Citations: | 16 - 1 self |
BibTeX
@MISC{Atallah89constructingtrees,
author = {M. J. Atallah and S. R. Kosaraju and L. L. Larmore and G. L. Miller and S-H. Teng},
title = {Constructing Trees in Parallel},
year = {1989}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
