Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Derivation of a parallel algorithm for balancing binary trees
IEEE Transactions on Software Engineering
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Parallel Dynamic Lowest Common Ancestors
SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
Improving Partial Rebuilding by Using Simple Balance Criteria
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of leaves and roots and the deletion of leaves. For a forest with a maximum of n vertices, the algorithm takes O(m/p + r log p + min(m,r log n)) time and O(n) space using p processors to process a sequence of m operations that are presented over r rounds. Furthermore, lowest common ancestor queries can be done in worst case constant time using a single processor. For one processor, the algorithm matches the bounds achieved by the best sequential algorithm known.