1. A. Aho, J. Hopcroft And J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.
2. M. Ajtai, J. KomlÓs and E. SzemerÉdi, An O(N log N) Sorting Network, Proc. of 15th ACM Symp. on Theory of Computing, 1983, pp. 1–9.
3. M. Ajtai, J. KomlÓs, W. L. Steiger, and E. SzemerÉdi, Optimal Parallel Selection Has Complexity O(log log N), J. of Computer and System Sciences, 38 (1989), pp. 125–133.
4. N. Alon And Y. Azar, Sorting, Approximate Sorting and Searching in Rounds, SIAM J. of Discrete Mathematics, 1 (1988), pp. 269–280.
5. N. Alon And Y. Azar, The Average Complexity of Deterministic and Randomized Parallel Comparison Sorting Algorithms, SIAM J of Computing, 17 (1988), pp. 1178–1192.