1. ABRAHAMSON, K., N. DADOUN, D. A. KIRKPATRICK and T. PRZYTYCKA, A simple parallel tree contraction algorithm, in: Proc. 25th Ann. Allerton Conf. on Communication, Control and Computing (1987) 624–633.
2. AGGARWAL, A. and R. J. ANDERSON, A random NC algorithm for depth first search, in: Proc. 19th Ann. ACM Symp. on Theory of Computing (1987) 325–334; revised version.
3. A random 1-011-011-01algorithm for depth first search
4. AGGARWAL, A., R. J. ANDERSON and M. KAO, Parallel depth-first search in general directed graphs, in: Proc. 21st Ann. ACM Symp. on Theory of Computing (1989) 297–308.
5. AGGARWAL, A., B. CHAZELLE, L. GUIBAS, C. O'DUNLAING and C. YAP, Parallel computational geometry, in: Proc. 26th Ann. IEEE Symp. on Foundations of Computer Science (1985) 468–477.