Computing Downwards Accumulations on Trees Quickly

Computing Downwards Accumulations on Trees Quickly (1995)

by Jeremy Gibbons , Jeremy Gibbons

Citations:

9 - 3 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Computing Downwards Accumulations on Trees Quickly	user correction - Legacy Corrections
AUTHOR NAME	Jeremy Gibbons	SVM HeaderParse 0.1
AUTHOR AFFIL	; Department of Computer Science; University of Auckland; Centre for Discrete Mathematics and	SVM HeaderParse 0.2
AUTHOR ADDR	; CDMTCS-002	SVM HeaderParse 0.1
AUTHOR NAME	Jeremy Gibbons	SVM HeaderParse 0.1
AUTHOR AFFIL	; Department of Computer Science; University of Auckland; Centre for Discrete Mathematics and	SVM HeaderParse 0.2
AUTHOR ADDR	; CDMTCS-002	SVM HeaderParse 0.2
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 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.	user correction - Legacy Corrections
YEAR	1995	user correction - Legacy Corrections
CITATIONS	20 found	ParsCit 1.0