PARALLEL TREE CONTRACTION AND ITS APPLICATION.
Publication
, Journal Article
Miller, GL; Reif, JH
Published in: Annual Symposium on Foundations of Computer Science (Proceedings)
January 1, 1985
The authors give a bottom-up algorithm to handle trees in which all modifications to the tree are done locally. This bottom-up approach, which they call CONTRACT, has two major advantages over the top-down approach: (1) The control structure is straightforward and easier to implement, facilitating new algorithms using fewer processors and less time. (2) Problems for which it was too difficult or too complicated to find polylog parallel algorithms are easy.
Duke Scholars
Altmetric Attention Stats
Dimensions Citation Stats
Published In
Annual Symposium on Foundations of Computer Science (Proceedings)
DOI
ISSN
0272-5428
Publication Date
January 1, 1985
Start / End Page
478 / 489
Citation
APA
Chicago
ICMJE
MLA
NLM
Miller, G. L., & Reif, J. H. (1985). PARALLEL TREE CONTRACTION AND ITS APPLICATION. Annual Symposium on Foundations of Computer Science (Proceedings), 478–489. https://doi.org/10.1109/sfcs.1985.43
Miller, G. L., and J. H. Reif. “PARALLEL TREE CONTRACTION AND ITS APPLICATION.” Annual Symposium on Foundations of Computer Science (Proceedings), January 1, 1985, 478–89. https://doi.org/10.1109/sfcs.1985.43.
Miller GL, Reif JH. PARALLEL TREE CONTRACTION AND ITS APPLICATION. Annual Symposium on Foundations of Computer Science (Proceedings). 1985 Jan 1;478–89.
Miller, G. L., and J. H. Reif. “PARALLEL TREE CONTRACTION AND ITS APPLICATION.” Annual Symposium on Foundations of Computer Science (Proceedings), Jan. 1985, pp. 478–89. Scopus, doi:10.1109/sfcs.1985.43.
Miller GL, Reif JH. PARALLEL TREE CONTRACTION AND ITS APPLICATION. Annual Symposium on Foundations of Computer Science (Proceedings). 1985 Jan 1;478–489.
Published In
Annual Symposium on Foundations of Computer Science (Proceedings)
DOI
ISSN
0272-5428
Publication Date
January 1, 1985
Start / End Page
478 / 489