1. A. Aggarwal and J. Park, “Parallel searching in multidimensional monotone arrays,” to appear in J. of Algorithms. (A preliminary version appeared in Proc. 29th Annual IEEE Symposium on Foundations of Computer Science, 1988, pp. 497–512.)
2. A. Aggarwal, D. Kravets, J. Park, and S. Sen, “Parallel searching in generalized Monge arrays with applications,” Proc. 2d Annual ACM Symposium on Parallel Algorithms and Architectures, 1990 (to appear).
3. A. Apostolico, M. J. Atallah, L. Larmore, and H. S. McFaddin, “Efficient Parallel Algorithms for String Editing and Related Problems,” Proc. 26th Annual Allerton Conf. on Communication, Control, and Computing, Monticello, Illinois, 1988, pp. 253–263. To appear, SIAM J. on Computing.
4. M. J. Atallah and S. R. Kosaraju, “An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix,” Purdue CS Tech. Rept. 959 (2/28/90).
5. M. J. Atallah, G. L. Miller, S. R. Kosaraju, L. Larmore and S. Teng, “Constructing Trees in Parallel”, Proc. 1st Annual ACM Symp. on Parallel Algorithms and Architectures, Santa Fe, New Mexico, 1989, pp. 421–431.