1. K. Abrahamson, N. Dadoun, D. A. Kirpatrick, and T. Przytycka, A Simple Parallel Tree Contraction Algorithm, Technical Report 87-30, Dept. of Computer Science, University of British Columbia, 1987.
2. P. K. Agarwal, A. Aggarwal, B. Aronov, S. Rao Kosaraju, B. Scheiber, and S. Suri, Computing External-Farthest Neighbors in a Simple Polygon,Discrete Appl. Math.,31(2), 1991, 97–111.
3. A. Aggarwal, B. Chazelle, L. Guibas, C. Ó'Dúnlaing, and C. Yap, Parallel Computational Geometry,Algorithmica,3(3), 1988, 293–328.
4. A. Aggarwal and J. K. Park, Parallel Searching in Multidimensional Monotone Arrays, manuscript, 1989.
5. R. J. Anderson and G. L. Miller, Deterministic Parallel List Ranking, inThird Aegan Workshop on Computing (AWOC 88) (J. H. Ref, ed.), Lecture Notes in Computer Science, Vol. 319, Springer-Verlag, Berlin, 1988, pp. 81–90.