1. Abrahamson, K., Dadoun, N., Kirkpatrick, D., Prztycka, T., A simple parallel tree contraction algorithm, Journal of Algorithms 10, 1989, 187–302.
2. Aggarwal, A., Optimal bounds for finding maximum on array of processors with k global buses, IEEE Transactions on Computers 35, 1986, 62–64.
3. Aggarwal, A., Chazelle, B., Guibas, L.J., O’Dúnlaing, C., Yap, C.K., Parallel computational geometry, Algorithmica 3, 1988, 293–327.
4. Akers, S.B., Harel, D., Krishnamurthy, B., The star graph: An attractive alternative to the n-cube, Proc. of the International Conference on Parallel Processing, 1987, 393–400.
5. Akers, S.B., Krishnamurthy, B., The fault tolerance of star graphs, Proc. of the International Conference on Supercomputing 3, 1987, 270–276.