Annual Review of Computer Science · 1988 · 100 citations · 69 references
ComputingComputer EngineeringComputer ScienceAlgorithmsParallel AlgorithmsParallel ComputingAlgorithm AnalysisData ParallelismParallel Algorithm DesignParallel ArchitecturesParallel ComputationParallel Prefix ComputationEar Decomposition
We have described a number of algorithmic tools that have been found useful in the construction of parallel algorithms; among these are prefix computation, ranking, Euler tours, ear decomposition, and matrix calculations. We have also described some of the applications of these tools, and listed many other applications. These algorithms seem likely to be useful not only in their own right, but also as examples of ways to break up other problems into parts suitable for parallel solution.
69
Depth-First Search and Linear Graph Algorithms
Robert E. Tarjan · SIAM Journal on Computing · 1972 · 6K citations
Richard E. Ladner, Michael J. Fischer · Journal of the ACM · 1980 · 1.3K citations · Full text
A Simple Parallel Algorithm for the Maximal Independent Set Problem
Michael Luby · SIAM Journal on Computing · 1986 · 1.1K citations
W. Daniel Hillis, Guy L. Steele · Communications of the ACM · 1986 · 891 citations · Full text
Parallelism in random access machines
Steven Fortune, James Wyllie · 1978 · 885 citations