Journal article icon

Journal article

Computing Downwards Accumulations on Trees Quickly

Abstract:

Downwards passes\\/ on binary trees are essentially functions which pass information down a tree, from the root towards the leaves. Under certain conditions, a downwards pass is both `efficient' (computable in a functional style in parallel time proportional to the depth of the tree) and `manipulable' (enjoying a number of distributivity properties useful in program construction); we call a downwards pass satisfying these conditions a downwards accumulation. In this paper, we show that these...

Expand abstract

Actions


Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
Journal:
Theoretical Computer Science More from this journal
Volume:
169
Issue:
1
Pages:
67-80
Publication date:
1996-01-01
UUID:
uuid:d0253f1e-4ebb-4a68-bef2-b2e7bece61eb
Local pid:
cs:2362
Deposit date:
2015-03-12

Terms of use


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