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...
| Autor principal: | |
|---|---|
| Formato: | Journal article |
| Publicado em: |
1996
|