M. Ajtai, J. Komll-os, and . Szemer-edi, E. Sorting in c log n Parallel Steps. Combinatorica, issue.1, pp.1-19

K. E. Batcher, Sorting Networks and their Applications, Proceedings of the AFIPS Spring Joint Computer Conference, vol.32, pp.307-314, 1968.

G. E. Blelloch, Scans as Primitive P arallel Operations, IEEE Transactions on Com, issue.11, pp.1526-1538, 1989.

G. E. Blelloch, Preex Sums and their Applications, 1990.

G. E. Blelloch, Vector Models for Data-Parallel Computing. C a m bridge (MA, vol.255, 1990.

G. E. Blelloch, C. G. Plaxton, C. E. Leiserson, S. J. Smith, B. M. Maggs et al., A Comparison of Sorting Algorithms for the Connection Machine CM-2. Thinking Machines Corporation, vol.30

R. Cole, Parallel Merge Sort. SIAM Journal on Computing, vol.17, issue.4, pp.770-785, 1988.

G. Manzini, Radix Sort on the Hypercube, Information Processing Letters, issue.38, pp.77-81, 1991.

J. H. Reif, Synthesis of Parallel Algorithms, vol.1011, 1993.

J. H. Reif and L. G. Valiant, A Logarithmic Time Sort for Linear Size Networks, Journal of the ACM, vol.34, issue.1, pp.60-76, 1987.