1. S. Akl and K. Lyons. Parallel Computational Geometry. Prentice Hall, 1993.
2. J. L. Bentley, K. L. Clarkson, and D. B. Levine. Fast linear expected-time algorithms for computing maxima and convex hulls. Algorithmica, pages 168–183, 2993.
3. A.A. Bertossi and M.A. Bonuccelli. Some parallel algorithms on interval graphs. Discrete Applied Mathematics, 16:101–111, 1987.
4. E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. Song. Efficient parallel graph algorithms for coarse grained multicomputers and bsp. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, Proceedings of ICALP’97, Lecture Notes in Computer Science, pages 390–400, 1997.
5. R. Cole. Parallel merge sort. SIAMJournal on Computing, pages 770–785, 1988.