1. A. V. Aho, J. E. Hopcropt, and J. E. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
2. S. G. Akl. Parallel Sorting Algorithms. Academic Press, Orlando, Florida, 1985.
3. S. G. Akl and N. Santoro. Optimal parallel merging and sorting without memory conflicts. IEEE Transactions on Computers, C-36(11):1367–1369, November 1987.
4. R. J. Anderson and G. L. Miller. Deterministic parallel list ranking. In Proc. 3rd Aegean Worksh. Comput., 1988.
5. M. Atai, J. Komlós, and E. Szemerédi. Sorting in c log n parallel steps. Combinatorica, 3(1):1–19, 1983.