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 ...
| 第一著者: | |
|---|---|
| フォーマット: | Journal article |
| 言語: | English |
| 出版事項: |
1996
|