Conference item

Computing Downwards Accumulations on Trees Quickly

Abstract:: Downwards accumulations on binary trees are essentially functions which pass information down a tree. Under certain conditions, these accumulations are both `efficient' (computable in a functional style in parallel time proportional to the depth of the tree) and `manipulable'. In this paper, we show that these conditions do in fact yield a stronger conclusion: the accumulation can be computed in parallel time proportional to the logarithm of the depth of the tree, on a CREW PRAM machine.

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.
Share
Cite

Cite this record

APA Style

Gibbons, J. (1993). Computing Downwards Accumulations on Trees Quickly.

MLA Style

Gibbons, J. “Computing Downwards Accumulations on Trees Quickly.” 1993.

Chicago Style

Gibbons, J. 1993. “Computing Downwards Accumulations on Trees Quickly.”
Print

Authors

+ Gibbons, J More by this author

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

Publisher:: Brisbane
Host title:: 16th Australian Computer Science Conference
Publication date:: 1993-02-01

UUID:: uuid:181b5edf-792b-4cc1-a9ea-85611adc8ae9
Local pid:: cs:2340
Deposit date:: 2015-03-12
ARK identifier:: ark:/29072/ora_181b5edf792b4cc1a9ea85611adc8ae9

Terms of use

Copyright date:: 1993

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