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 con...

Expand abstract
Publication status:
Published

Actions


Access Document


Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
Journal:
THEORETICAL COMPUTER SCIENCE
Volume:
169
Issue:
1
Pages:
67-80
Publication date:
1996-11-30
DOI:
ISSN:
0304-3975
URN:
uuid:97eaeb3d-ee8c-41c7-b8dc-00cb9120e865
Source identifiers:
163522
Local pid:
pubs:163522
Language:
English

Terms of use


Metrics



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

TO TOP