The Level Ancestor Problem Simplified
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Ancestor Problems on Pure Pointer Machines
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Research note: Efficient nearer-ancestor algorithm for network routing
Computer Communications
Discrete range searching primitive for the GPU and its applications
Journal of Experimental Algorithmics (JEA)
| Hi-index | 0.00 |
The authors introduce a fundamentally novel parallel data structure, called recursive *-tree (star tree). For its definition, they use a generalization of this * functional and apply it to functions other than log. Using recursion in the spirit of the inverse-Akermann function, they derive recursive *-trees. The recursive *-tree data structure leads to a new design paradigm for parallel algorithms. The paradigm allows for unusually fast parallel computations that need only constant time, using an optimal number of processors under the assumption that a very small number of processors can write simultaneously, each into different bits of the same word.