1. Aggarwal,A., and Anderson,R., ‘A Random NC Algorithm for Depth First Search,'to appear in Proc. of the 19th annual ACM Symposium on Theory Of Computing, 1987.
2. Alt,H., Hagerup,T., Mehlhorn,K., and Preparata,F.P., 'simulation of Idealized Parallel Computers on more Realistic ones,’ Preliminary Report.
3. Aho, A.U., Hopcroft, J.E., Ullman, J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley Publishing Company, Massachusetts, 1977.
4. Ajtai, M., Komlós, J., and Szemerédi, E., ‘An O(n log n) Sorting Network,’ Combinatorica, 3, 1983. pp. 1–19.
5. Adleman,L., and Manders,K., ‘Reducibility, Randomness and Untractability,’ Proc. 9th ACM Symposium on Theory Of Computing, 1977. pp. 151–163.