1. M. Adler, P.B. Gibbons, Y. Matias, and V. Ramachandran, Modeling parallel bandwidth: Local vs. global restrictions, In Proc. 9th ACM Symp. on Parallel Algorithms and Architectures, 94–105, June 1997.
2. A. Aggarwal, A.K. Chandra, and M. Snir, Communication complexity of PRAMs, Theoretical Computer Science, 71(1):3–28, 1990.
3. M. Ajtai, J. Komlos, and E. Szemeredi, Sorting in clgn parallel steps, Combinatorica, 3(1):1–19, 1983.
4. A. Alexandrov, M.F. Ionescu, K.E. Schauser, and C. Sheiman, LogGP: Incorporating long messages into the LogP model — one step closer towards a realistic model for parallel computation, In Proc. 7th ACM Symp. on Parallel Algorithms and Architectures,95–105, July 1995.
5. B. Alpern, L. Carter, and E. Feig, Uniform memory hierarchies, In Proc. 31st IEEE Symp. on Foundations of Computer Science, 600–608, October 1990.