Towards a single model of efficient computation in real parallel machines

[1]  James Christopher Wyllie,et al.  The Complexity of Parallel Computations , 1979 .

[2]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[3]  Allan Gottlieb,et al.  Complexity Results for Permuting Data and Other Computations on Parallel Processors , 1984, JACM.

[4]  John H. Reif,et al.  An optimal parallel algorithm for integer sorting , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[5]  Frank Thomson Leighton,et al.  Tight Bounds on the Complexity of Parallel Sorting , 1985, IEEE Trans. Computers.

[6]  Larry Rudolph,et al.  The power of parallel prefix , 1985, IEEE Transactions on Computers.

[7]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[8]  Larry Rudolph,et al.  Parallel Prefix on Fully Connected Direct Connection Machines , 1986, ICPP.

[9]  D J Kuck,et al.  Parallel Supercomputing Today and the Cedar Approach , 1986, Science.

[10]  Lawrence Snyder,et al.  Type architectures, shared memory, and the corollary of modest potential , 1986 .

[11]  Yijie Han,et al.  : Parallel Algorithms for Bucket Sorting and the Data Dependent Prefix Problem , 1986, ICPP.

[12]  Christos H. Papadimitriou,et al.  A Communication-Time Tradeoff , 1987, SIAM J. Comput..

[13]  Gary L. Miller,et al.  Deterministic Parallel List Ranking , 1988, AWOC.

[14]  Richard M. Karp,et al.  A Survey of Parallel Algorithms for Shared-Memory Machines , 1988 .

[15]  Bruce M. Maggs,et al.  Universal packet routing algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[16]  Richard Cole,et al.  Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time , 1988, SIAM J. Comput..

[17]  Lawrence Snyder,et al.  Efficient communication in massively parallel computers , 1989 .

[18]  Yijie Han,et al.  Parallel Algorithms for Computing Linked List Prefix , 1989, J. Parallel Distributed Comput..

[19]  Alan Gibbons,et al.  A Class of Problems Efficiently Solvable on Mesh-Connected Computers Including Dynamic Expression Evaluation , 1989, Inf. Process. Lett..

[20]  C. Greg Plaxton,et al.  Deterministic sorting in nearly logarithmic time on the hypercube and related computers , 1990, STOC '90.

[21]  Leslie G. Valiant,et al.  General Purpose Parallel Architectures , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

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

[23]  Larry Rudolph,et al.  A Complexity Theory of Efficient Parallel Algorithms , 1990, Theor. Comput. Sci..