this paper and supplied many helpful comments. This research was supported in part by NSF grants DCR-85-11713, CCR-86-05353, and CCR-88-14977, and by DARPA contract N00039-84-C-0165.
|
2010
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
689
|
Depth-first search and linear graph algorithms
– Tarjan
- 1972
|
|
538
|
Matrix multiplication via arithmetic progressions
– Coppersmith, Winograd
- 1990
|
|
234
|
Parallel prefix computation
– Ladner, Fischer
- 1980
|
|
222
|
The parallel evaluation of general arithmetic expressions
– Brent
- 1974
|
|
218
|
Applying parallel computation algorithms in the design of serial algorithms
– Megiddo
- 1983
|
|
196
|
Data Parallel Algorithms
– Hillis, Steele
|
|
189
|
How to emulate shared memory
– Ranade
- 1991
|
|
155
|
An O(n log n) sorting network
– Ajtai, Komlos, et al.
- 1983
|
|
145
|
U.: On finding lowest common ancestors: Simplification and parallelization
– Schieber, Vishkin
- 1988
|
|
115
|
Matching is as easy as matrix inversion
– Mulmuley, Vazirani, et al.
- 1987
|
|
111
|
Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
– Mehlhorn, Vishkin
- 1990
|
|
95
|
Parallelism in comparison problems
– Valiant
- 1975
|
|
81
|
Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking
– Cole, Vishkin
- 1986
|
|
66
|
Finding the maximum, merging and sorting in a parallel computation model
– Shiloach, Vishkin
- 1981
|
|
65
|
Data broadcasting in SIMD computers
– Nassimi, Sahni
- 1981
|
|
64
|
Approximate and exact parallel scheduling with applications to list, tree, and graph problems
– Cole, Vishkin
- 1986
|
|
54
|
Computing an st-numbering
– Even, Tarjan
- 1976
|
|
51
|
Parallel hashing: an efficient implementation of shared memory
– Karlin, Upfal
- 1988
|
|
49
|
Deterministic Coin Tossing and Accelerating Cascades: Micro and Macro Techniques for Designing Parallel Algorithms
– Cole, Vishkin
- 1986
|
|
47
|
The power of parallel prefix
– Kruskal, Rudolph, et al.
- 1985
|
|
46
|
Deterministic parallel list ranking
– Anderson, Miller
- 1991
|
|
45
|
Relations between concurrent-write models of parallel computation
– Fich, Ragde, et al.
- 1988
|
|
45
|
Non-separable and planar graphs
– Whitney
- 1932
|
|
43
|
Finding biconnected components and computing tree functions in logarithmic parallel time
– Tarjan, Vishkin
- 1984
|
|
42
|
The complexity of parallel computations
– Wyllie
- 1979
|
|
41
|
An optimal randomized parallel algorithm for finding connected components in a graph
– Gazit
- 1991
|
|
41
|
Parallel ear decomposition search (EDS) and stnumbering in graphs
– Maon, Schieber, et al.
- 1986
|
|
33
|
Optimal parallel algorithms for string matching
– Galil
- 1985
|
|
28
|
A fast and simple randomized parallel algorithm for maximal matching
– Israeli, Itai
- 1986
|
|
25
|
An Optimal Parallel Algorithm for Integer Sorting
– Reif
- 1985
|
|
24
|
A simple randomized parallel algorithm for list-ranking
– Anderson, Miller
- 1990
|
|
23
|
A random NC algorithm for depth first search
– Aggarwal, Anderson
- 1987
|
|
22
|
Efficient parallel ear decomposition with applications
– Miller, Ramachandran
- 1986
|
|
22
|
Randomized speed-ups in parallel computation
– Vishkin
- 1984
|
|
21
|
An improved parallel algorithm for maximal matching
– Israeli, Shiloach
- 1986
|
|
21
|
Improved algorithms for graph four-connectivity
– Kanevsky, Ramachandran
- 1991
|
|
20
|
A parallel-design distributed-implementation (PDDI) general purpose computer
– Vishkin
- 1984
|
|
17
|
Constructing a perfect matching is
– Karp, Upfal, et al.
- 1986
|
|
14
|
On efficient parallel strong orientation
– Vishkin
- 1985
|
|
13
|
Parallel algorithms for the transitive closure and the connected components problems
– Hirschberg
- 1976
|
|
12
|
Design and Analysis of Some Parallel Algorithms
– Schieber
- 1987
|
|
11
|
Optimal parallel algorithms for expression tree evaluation and list ranking
– Cole, Vishkin
- 1988
|
|
11
|
Parallel Computation and Conflicts in Memory Access
– Kucera
- 1982
|
|
10
|
Finding Euler tours in parallel
– Atallah, Vishkin
- 1984
|
|
10
|
Incomparability in parallel computation
– Grolmusz, Ragde
- 1990
|
|
8
|
Parallel Recognition of Series-Parallel Graphs
– Eppstein
- 1992
|
|
6
|
Efficient Simulations between Concurrent-Read Concurrent-Write PRAM Models
– Chlebus, Diks, et al.
- 1988
|
|
5
|
Simulations among concurrent-write PRAMs, Algorithmica 3
– Fich, Ragde, et al.
- 1988
|
|
5
|
Parallel Recognition and Decomposition of Two
– He, Yesha
- 1987
|
