Computing Downwards Accumulations on Trees Quickly
<em>Downwards accumulations</em> on binary trees are essentially functions which pass information down a tree. Under certain conditions, these accumulations are both `efficient' (computable in a functional style in parallel time proportional to the depth of the tree) and `manipulabl...
| Main Author: | |
|---|---|
| Format: | Conference item |
| Published: |
Brisbane
1993
|
Search Result 1
Search Result 2
