1. K. Abrahamson, N. Dadoun, D. A. Kirpatrick, and T. Przytycka, A Simple Parallel Tree Contraction Algorithm, TR 87-30, Department of Computer Science, University of British Columbia, 1987.
2. A. Aggarwal, B. Chazelle, L. Guibas, C. Ó'Dúnlaing, and C. Yap, Parallel computational geometry,Algorithmica,3(3) (1988), 293–328.
3. R. J. Anderson and G. L. Miller, Deterministic parallel list ranking, AWOC 88, Lecture Notes in Computer Science, Vol. 319, Springer-Verlag, Berlin, 1988, pp. 81–90.
4. M. J. Atallah, R. Cole, and M. T. Goodrich, Cascading divide-and-conquer: a technique for designing parallel algorithms,S1AM J. Comput.,18(3) (1989), 499–532.
5. M. J. Atallah and M. T. Goodrich, Efficient parallel solutions to some geometric problems,J. Parallel Distrib. Comput.,3(4), 1986, 492–507.