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 `manip...
主要作者: | Gibbons, J |
---|---|
格式: | Journal article |
出版: |
1996
|
相似書籍
-
Computing downwards accumulations on trees quickly
由: Gibbons, J
出版: (1996) -
Computing Downwards Accumulations on Trees Quickly
由: Gibbons, J
出版: (1993) -
Upwards and Downwards Accumulations on Trees
由: Gibbons, J
出版: (1993) -
Polytypic Downwards Accumulations
由: Gibbons, J
出版: (1998) -
Generic Downwards Accumulations
由: Gibbons, J
出版: (2000)