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

Volledige beschrijving

Bibliografische gegevens
Hoofdauteur: Gibbons, J
Formaat: Journal article
Taal:English
Gepubliceerd in: 1996
Search Result 1

Computing Downwards Accumulations on Trees Quickly door Gibbons, J

Gepubliceerd in 1996
Journal article
Search Result 2

Computing Downwards Accumulations on Trees Quickly door Gibbons, J

Gepubliceerd in 1993
Conference item