1. M. Ajtai, J. Komlós, W. Steiger and E. Szemerédi,Almost sorting in one round, preprint.
2. M. Ajtai, J. Komlós and E. Szemerédi,An O(n logn) sorting network, ACM Symposium on Theory of Computing15 (1983), 1–9.
3. M. Ajtai, J. Komlós and E. Szemerédi,Sorting in c logn parallel steps, Combinatorica3 (1983), 1–19.
4. N. Alon, Y. Azar and U. Vishkin,Tight complexity bounds for parallel comparison sorting, Proc. 27th Annal Symp. on Foundations of Computer Science, Toronto, IEEE, 1986, pp. 502–510.
5. B. Bollobás,Random Graphs, Academic Press, London, 1985, xv + 447pp.