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 ...
Príomhchruthaitheoir: | Gibbons, J |
---|---|
Formáid: | Journal article |
Teanga: | English |
Foilsithe / Cruthaithe: |
1996
|
Míreanna comhchosúla
Míreanna comhchosúla
-
Computing Downwards Accumulations on Trees Quickly
de réir: Gibbons, J
Foilsithe / Cruthaithe: (1996) -
Computing Downwards Accumulations on Trees Quickly
de réir: Gibbons, J
Foilsithe / Cruthaithe: (1993) -
Upwards and Downwards Accumulations on Trees
de réir: Gibbons, J
Foilsithe / Cruthaithe: (1993) -
Generic downwards accumulations
de réir: Gibbons, J
Foilsithe / Cruthaithe: (2000) -
Polytypic Downwards Accumulations
de réir: Gibbons, J
Foilsithe / Cruthaithe: (1998)