Add to ORKGAccumulations 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 algorithms. We present two EREW PRAM algorithms for computing accumulations on trees taking O(\\log n) time on O(n/\\log n) processors, which is optimal
The concept of a tree has been used in various areas of mathematics for over a century. In particula...
Trees are a useful data type, but they are not routinely included in parallel programming systems be...
A parallel algorithm is given which constructs an optimal alphabetic tree in O(log³ n) time with n² ...
Accumulations are higher-order operations on structured objects; they leave the shape of an object u...
AbstractAccumulations are higher-order operations on structured objects; they leave the shape of an ...
Accumulations are higher-order operations on structured objects; they leave the shape of an object u...
Downwards accumulations on binary trees are essentially functions which pass information down a tree...
Downwards passes on binary trees are essentially functions which pass information down a tree, from ...
AbstractDownwards passes on binary trees are essentially functions which pass information down a tre...
We present an optimal parallel algorithm for the construction of(a, b)-trees-a generalization of 2-3...
This report contains Fork95 implementations of basic parallel operations on trees, like rooting and ...
We present an optimal parallel algorithm for the construction of (a, b)-trees-a generalization of 2-...
The tree-layout problem is to compute the coordinates of nodes of a tree so that the tree, when draw...
AbstractThis paper presents results which improve the efficiency of parallel algorithms for computin...
We present a linear-time sequential algorithm for the construction of a binary tree, given its preor...
The concept of a tree has been used in various areas of mathematics for over a century. In particula...
Trees are a useful data type, but they are not routinely included in parallel programming systems be...
A parallel algorithm is given which constructs an optimal alphabetic tree in O(log³ n) time with n² ...
Accumulations are higher-order operations on structured objects; they leave the shape of an object u...
AbstractAccumulations are higher-order operations on structured objects; they leave the shape of an ...
Accumulations are higher-order operations on structured objects; they leave the shape of an object u...
Downwards accumulations on binary trees are essentially functions which pass information down a tree...
Downwards passes on binary trees are essentially functions which pass information down a tree, from ...
AbstractDownwards passes on binary trees are essentially functions which pass information down a tre...
We present an optimal parallel algorithm for the construction of(a, b)-trees-a generalization of 2-3...
This report contains Fork95 implementations of basic parallel operations on trees, like rooting and ...
We present an optimal parallel algorithm for the construction of (a, b)-trees-a generalization of 2-...
The tree-layout problem is to compute the coordinates of nodes of a tree so that the tree, when draw...
AbstractThis paper presents results which improve the efficiency of parallel algorithms for computin...
We present a linear-time sequential algorithm for the construction of a binary tree, given its preor...
The concept of a tree has been used in various areas of mathematics for over a century. In particula...
Trees are a useful data type, but they are not routinely included in parallel programming systems be...
A parallel algorithm is given which constructs an optimal alphabetic tree in O(log³ n) time with n² ...