[1]

A. Aggarwal, A. K. Chandra, and M. Snir, On communication latency in PRAM computations,*Proc. First ACM Symp. on Parallel Algorithms and Architectures*, 1989, pp. 11–21.

[2]

A. Aggarwal, A. K. Chandra, and M. Snir, Communication complexity of PRAMs,

*Theoret. Comput. Sci.*
**71** (1990), 3–28.

MATHCrossRefMathSciNetGoogle Scholar[2a]

A. Aggarwal and J. S. Vitter, The input/output complexily of sorting and related problems,

*Comm. ACM*
**31**(9) (1988), 1116–1127.

CrossRefMathSciNetGoogle Scholar[3]

W. Aiello, T. Leighton, B. Maggs, and M. Newman, Fast algorithms for bit-serial routing on a hypercube,*Proc. 2nd Annual ACM Symp. on Parallel Algorithms and Architectures*, 1990, pp. 55–64.

[4]

J. L. Carter and M. N. Wegman, Universal classes of hash functions,

*J. Comput. System Sci.*
**18** (1979), 143–154.

MATHCrossRefMathSciNetGoogle Scholar[5]

A. Chin, Complexity issues in general-purpose parallel computation, D.Phil, thesis, Oxford University, 1991.

[6]

A. Chin, Latency hiding for fault-tolerant PRAM computations,

*Proc. Internat. Conf. on Sets, Graphs and Numbers*, D. Miklos, ed., North-Holland, Amsterdam, 1992.

Google Scholar[7]

A. Chin, Permutations on the Block PRAM,

*Inform. Process. Lett.*
**45** (1993), 69–73.

MATHCrossRefMathSciNetGoogle Scholar[8]

R. Cole and O. Zajicek, The APRAM: incorporating asynchrony into the PRAM model,*Proc. First Annual ACM Symp. on Parallel Algorithms and Architectures*, 1989, pp. 169–178.

[9]

M. Dietzfelberger and F. Meyer auf der Heide, How to distribute a dictionary in a complete network,*Proc. 22nd Annual ACM Symp. on Theory Computing*, 1990, pp. 117–127.

[9a]

R. W. Floyd, Permuting information in idealized two-level storage, in

*Complexity of Computer Calculations*, R. Miller and J. Thatcher, eds., Plenum, New York, 1972, pp. 105–109.

Google Scholar[10]

G. E. Forsythe and C. B. Moler,

*Computer Solution of Linear Algebraic Systems*, Prentice-Hall, Englewood Cliffs, NJ, 1967.

MATHGoogle Scholar[11]

A. M. Gibbons and W. Rytter,

*Efficient Parallel Algorithms*, Cambridge University Press, Cambridge, 1988.

MATHGoogle Scholar[12]

P. Gibbons, The asynchronous PRAM: a semi-synchronous model for shared memory MIMD machines, Ph.D. thesis, University of California at Berkeley, 1989.

Google Scholar[13]

J. Håstad, T. Leighton, and M. Newman, Fast computation using faulty hypercubes,*Proc. 21st Annual ACM Symp. on Theory of Computing*, 1989, pp. 251–263.

[14]

T. Heywood and S. Ranka, A practical hierarchical model of parallel computation: the model, Technical Report SU-CIS-91-06, Syracuse University, Syracuse, NY 10991.

[15]

P. Kanellakis and A. Shvartsman, Efficient parallel algorithms can be made robust,*Proc. 8th Annual ACM Symp. on Principles of Distributed Computing*, 1989, pp. 211–222.

[16]

A. Karlin and E. Upfal, Parallel hashing: an efficient implementation of shared memory,

*J. Assoc. Comput. Mach.*
**35** (1988), 876–892.

MATHMathSciNetGoogle Scholar[17]

R. M. Karp, M. Luby, and F. Meyer auf der Heide, Efficient PRAM simulation on a distributed memory machine,*Proc. 24th Annual ACM Symp. on Theory of Computing*, 1992, pp. 318–326.

[18]

R. M. Karp and V. Ramachandran, Parallel algorithms for shared-memory machines,

*Handbook of Theoretical Computer Science* (J. van Leeuwen, ed.), North-Holland, Amsterdam, 1990, pp. 869–942.

Google Scholar[19]

Z. M. Kedem, K. V. Palem, and P. G. Spirakis, Efficient robust parallel computations,*Proc. 22nd Annual ACM Symp. on Theory of Computing*, 1990, pp. 138–148.

[20]

F. T. Leighton and C. G. Plaxton, A (fairly) simple circuit that (usually) sorts,*Proc. 31st Annual IEEE Symp. on Foundations of Computer Science*, 1990, pp. 264–274.

[21]

Y.-D. Lyuu, Fast fault-tolerant parallel communication and on-line maintenance using information dispersal,*Proc. Second ACM Symp. on Parallel Algorithms and Architectures*, 1990, pp. 378–387.

[22]

W. F. McColl, General purpose parallel computing, in

*Lectures on Parallel Computation*, A. Gibbons and P. Spirakis, eds., Cambridge University Press, Cambridge, 1993, pp. 337–391.

Google Scholar[23]

C. Martel, A. Park, and R. Subramonian, Optimal asynchronous algorithms for shared-memory parallel computers, Technical Report CSE-89-8, University of California at Davis, 1989.

[24]

K. Mehlhorn and U. Vishkin, Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories,

*Acta Inform.*
**21** (1984), 339–374.

MATHCrossRefMathSciNetGoogle Scholar[25]

J. K. Mullin, A caution on universal classes of hash functions,

*Inform. Process. Lett.*
**37** (1991), 247–256.

MATHCrossRefMathSciNetGoogle Scholar[26]

N. Nishimura, Asynchronous shared memory parallel computation,*Proc. Second Annual ACM Symp. on Parallel Algorithms and Architectures*, 1990, pp. 76–84.

[27]

A. G. Ranade, How to emulate shared memory,*Proc. 28th Annual IEEE Symp. on Foundations of Computer Science*, 1987, pp. 185–194.

[28]

A. Siegel, On universal classes of fast high-performance hash functions, their time-space tradeoff, and their applications,*Proc. 30th IEEE Symp. on Foundations of Computer Science*, 1989, pp. 20–25.

[29]

E. Upfal and A. Wigderson, How to share memory in a distributed system,*Proc. 25th Annual IEEE Symp. on Foundations of Computer Science*, 1984, pp. 171–180.

[30]

L. G. Valiant, A bridging model for parallel computation,

*Comm. ACM*
**33** (1990), 103–111.

CrossRefGoogle Scholar[31]

L. G. Valiant, General purpose parallel architectures,

*Handbook of Theoretical Computer Science* (J. van Leeuwen, ed.), North-Holland, Amsterdam, 1990, pp. 103–110.

Google Scholar[32]

L. G. Valiant and G. J. Brebner, Universal schemes for parallel communication,*Proc. 13th Annual ACM Symp. on Theory of Computing*, 1981, pp. 263–277.