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 ...
第一著者: | Gibbons, J |
---|---|
フォーマット: | Journal article |
言語: | English |
出版事項: |
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) -
Generic downwards accumulations
著者:: Gibbons, J
出版事項: (2000) -
Polytypic Downwards Accumulations
著者:: Gibbons, J
出版事項: (1998)