Efficient Parallel Algorithms for Tree Accumulations
Accumulations are higher-order operations on structured objects; they leave the shape of an object unchanged, but replace elements of that object with accumulated information about other elements. Upwards and downwards accumulations on trees are two such operations; they form the basis of many tree...
Main Authors: | Gibbons, J, Cai, W, Skillicorn, D |
---|---|
פורמט: | Journal article |
יצא לאור: |
1994
|
פריטים דומים
-
EFFICIENT PARALLEL ALGORITHMS FOR TRE ACCUMULATIONS
מאת: Gibbons, J, et al.
יצא לאור: (1994) -
Upwards and Downwards Accumulations on Trees
מאת: Gibbons, J
יצא לאור: (1993) -
Computing downwards accumulations on trees quickly
מאת: Gibbons, J
יצא לאור: (1996) -
Computing Downwards Accumulations on Trees Quickly
מאת: Gibbons, J
יצא לאור: (1993) -
Computing Downwards Accumulations on Trees Quickly
מאת: Gibbons, J
יצא לאור: (1996)