Journal article

Efficient Parallel Algorithms for Tree Accumulations

Abstract:: Accumulations are higher-order operations on structured objects; they leave the shape of an object unchanged, but replace elements of that object with accumulated information about other elements. Upwards and downwards accumulations on trees are two such operations; they form the basis of many tree algorithms. We present two EREW PRAM algorithms for computing accumulations on trees taking O(\\log n) time on O(n/\\log n) processors, which is optimal.

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Gibbons, J., Cai, W., & Skillicorn, D. (1994). Efficient Parallel Algorithms for Tree Accumulations. Science of Computer Programming, 23, 1–18.

MLA Style

Gibbons, J., et al. “Efficient Parallel Algorithms for Tree Accumulations.” Science of Computer Programming, vol. 23, 1994, pp. 1–18.

Chicago Style

Gibbons, J, W Cai, and D Skillicorn. 1994. “Efficient Parallel Algorithms for Tree Accumulations.” Science of Computer Programming 23: 1–18.
Share
Print

Authors

+ Gibbons, J More by this author

Institution:: University of Oxford
Division:: MPLS
Department:: Computer Science
Role:: Author

+ Cai, W More by this author

Role:: Author

+ Skillicorn, D More by this author

Role:: Author

Journal:: Science of Computer Programming More from this journal
Volume:: 23
Pages:: 1-18
Publication date:: 1994-01-01

UUID:: uuid:f3a3375e-e92c-4070-93cf-feb8e935ce06
Local pid:: cs:2371
Deposit date:: 2015-03-12

Terms of use

Copyright date:: 1994

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP