1. A. V. Aho, J. E. Hopcroft and J. D. Ullman, The design and analysis of computer
algorithms, Addison-Wesley 1974.
2. M. Aigner, Producing posets, Discrete Math. 35 (1981) 1–15.
3. M. Ajtai, J. Komlós and E. Szemerédi, AnO (nlogn) sorting network, ACM Symposium on Theory of Computing 15 (1983) 1–9.
4. M. Ajtai, J. Komlós and E. Szemerédi, Sorting in clogn parallel steps, Combinatorica 3 (1983) 1–19.
5. N. Alon, A geometric construction of highly expanding graphs and sorting in two rounds, to appear.