Computing downwards accumulations on trees quickly

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

Disgrifiad llawn

Manylion Llyfryddiaeth
Prif Awdur: Gibbons, J
Fformat: Journal article
Iaith:English
Cyhoeddwyd: 1996