1. A. Aggarwal, J. S. Chang, and C. K. Yap (1985). Minimum area circumscribing polygons.Visual Comput.,1, pp. 112–117.
2. A. Aggarwal, M. Klawe, S. Moran, P. Shor, and R. Wilber (1986). Geometric applications of a matrix searching algorithm.Proc. 2nd ACM Symposium on Computational Geometry, pp. 285–292.
3. A. Aggarwal, B. Chazelle, L. Guibas, C. Ó'Dúnlaing, and C. K. Yap (1987). Parallel computational geometry. Robotics Report No. 115, Courant Institute, New York University. (Reported at the 26th IEEE FOCS Symposium, Portland, Oregon, 1985.)
4. M. Ajtai, J. Komlós, and E. Szemerédi (1982). AnO(n log(n)) Sorting Network.Proc. 15th ACM Symposium on Theory of Computing, pp. 1–9. Also inCombinatorica,3(1) (1983), pp. 1–19.
5. S. Akl (1983). Parallel algorithm for convex hulls. Manuscript, Department of Computer Science, Queen's University, Kingston, Ontario.