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 ...
Prif Awdur: | Gibbons, J |
---|---|
Fformat: | Journal article |
Iaith: | English |
Cyhoeddwyd: |
1996
|
Eitemau Tebyg
-
Computing Downwards Accumulations on Trees Quickly
gan: Gibbons, J
Cyhoeddwyd: (1996) -
Computing Downwards Accumulations on Trees Quickly
gan: Gibbons, J
Cyhoeddwyd: (1993) -
Upwards and Downwards Accumulations on Trees
gan: Gibbons, J
Cyhoeddwyd: (1993) -
Generic downwards accumulations
gan: Gibbons, J
Cyhoeddwyd: (2000) -
Polytypic Downwards Accumulations
gan: Gibbons, J
Cyhoeddwyd: (1998)