1. Ajtai, M., Komlos, J., Steiger, W. L. et al., An O(nlogn) sorting network,Proc. Ann. ACM Symp. Theory of Computing, 1983, 1–9.
2. Akl, S. G., Santoro, N., Optimal parallel merging and sorting without memory conflict,IEEE Trans. on Computers, 1987, 36(11): 1367.
3. Batcher, K. E., Sorting networks and their applications, in 1968Spring Joint Comput. Conf. AFIPS Proc., Washington D C: Thompson Book Company, 1968, 32: 307–314.
4. Proc. of 1990 International Conference on Parallel Processing;K.E. Batcher,1990
5. Leighton, T.,Introduction to Parallel Algorithms and Architectures: Arrays. Trees. Hypercubes, San Mateo: Morgan-Kaufman, 1991.