An Introduction to Parallel Algorithms

[1]  Gianfranco Bilardi,et al.  Deterministic Simulations of PRAMs on Bounded Degree Networks , 1994, SIAM J. Comput..

[2]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[3]  Alok Aggarwal,et al.  Communication Complexity of PRAMs , 1990, Theor. Comput. Sci..

[4]  Kieran T. Herley,et al.  Efficient simulations of small shared memories on bounded degree networks , 1989, 30th Annual Symposium on Foundations of Computer Science.

[5]  Udi Manber,et al.  Introduction to algorithms - a creative approach , 1989 .

[6]  Eli Upfal,et al.  Parallel hashing: an efficient implementation of shared memory , 1988, JACM.

[7]  Abhiram G. Ranade,et al.  How to emulate shared memory , 1991, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[8]  W. Daniel Hillis,et al.  Data parallel algorithms , 1986, CACM.

[9]  Kurt Mehlhorn,et al.  Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones , 1986, SIAM J. Comput..

[10]  Kai Hwang,et al.  Computer architecture and parallel processing , 1984, McGraw-Hill Series in computer organization and architecture.

[11]  Selim G. Akl,et al.  Design and analysis of parallel algorithms , 1985 .

[12]  Uzi Vishkin,et al.  An O(n² log n) Parallel MAX-FLOW Algorithm , 1982, J. Algorithms.

[13]  Daniel S. Hirschberg Fast parallel sorting algorithms , 1978, CACM.

[14]  Franco P. Preparata,et al.  New Parallel-Sorting Schemes , 1978, IEEE Transactions on Computers.

[15]  Leslie M. Goldschlager,et al.  A unified approach to models of synchronous parallel machines , 1978, STOC.

[16]  Steven Fortune,et al.  Parallelism in random access machines , 1978, STOC.

[17]  C. Savage Parallel Algorithms for Graph Theoretic Problems , 1977 .

[18]  Denise Marie Eckstein Parallel graph processing using depth-first search and breadth-first search. , 1977 .

[19]  Daniel S. Hirschberg,et al.  Parallel algorithms for the transitive closure and the connected component problems , 1976, STOC '76.

[20]  Eshrat Arjomandi A study of parallelism in graph theory. , 1976 .

[21]  L. Csanky,et al.  Fast parallel matrix inversion algorithms , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[22]  Allan Borodin,et al.  The computational complexity of algebraic and numeric problems , 1975, Elsevier computer science library.

[23]  Richard P. Brent,et al.  The Parallel Evaluation of General Arithmetic Expressions , 1974, JACM.