1. K. Abrahamson and N. Dadoun and D. G. Kirkpatrick and T. Przytycka. A simple parallel tree contraction algorithm. Technical Report 87–30, Department of Computer Science, University of British Columbia, Vancouver; August 1987.
2. A. Aggarwal and R. J. Anderson. A random NC algorithm for depth first search. Combinatorica, 8(1): 1–12, 1988.
3. A. Aggarwal and R. J. Anderson and M.-Y. Kao. Parallel depth-first search in general directed graphs. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (Seattle, Washington, May 15–17, 1989), pages 297–308, 1989.
4. A. V. Aho and J. E. Hopcroft and J. D. Ullman. The design and analysis of computer algorithms. Addison-Wesley 1974.
5. N. Alon and L. Babai and A. Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms, 7(4): 567–583, 1986.