1. A. Aggarwal, B. Chazelle, L. Guibas, C. O’Dunlaing and C. Yap. “Parallel computational geometry”, Algorithmica, 3, pp. 293–327, 1988.
2. N. Alon, and N. Meggido. Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time. The Thirty First Symposium on Foundations of Computer Science, pp. 574–582, 1990.
3. G.E. Blelloch, C.E. Leiserson, B.M. Maggs, C.G. Plaxton, S. J. Smith, and M. Zagha. “A Comparison of Sorting Algorithms for the Connection Machine CM-2,” The third Annual ACM Symposium on Parallel Algorithms and Architecture, pp. 3–16, 1991.
4. E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. W. Song, “Efficient parallel graph algorithms for coarse grained multicomputers and BSP,” Proc. 24th International Colloquium on Automata, Languages and Programming (ICALP’97), Bologna, Italy, 1997, Springer Verlag Lecture Notes in Computer Science, Vol. 1256, pp. 390–400.
5. D. Culler, R. Karp, D. Patterson, A.Sahay, K. E. Schauser, E.Santos, R. Subramonian, and T. von Eicken. “LogP: Towards a Realistic Model of Parallel Computation,” Proceedings of the 4th ACM SIG- PLAN Symposium on Principles and Practice of Parallel Programming, pp. 235–261, 1993.