1. N. Alon, L. Babai, and A. Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms, 7:567–583, 1986.
2. K. Abrahamson, N. Dadoun, D. A. Kirkpatrick, and T. Przytycka. A simple parallel tree contraction algorithm. Technical Report 87-30, The University of British Columbia, 1987.
3. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The design and analysis of computer algorithms. Addison-Wesley, Reading, MA, 1974.
4. B. Awerbuch, A. Israeli, and Y. Shiloach. Finding Euler circuits in logarithmic parallel time. In Proc. of the 16th Ann. ACM Symp. on Theory of Computing, pages 249–257, May 1984.
5. S.G. Akl. The Design and Analysis of Parallel Algorithms. Prentice Hall, Engelwood Cliffs, New Jersey, 1989.