1. Alon N., and Azar Y., (Dec. 1988), The average complexity of deterministic and randomized parallel comparison-sorting algorithms, SIAM J. Computing. Vol 17, No. 6.
2. Batcher K. E., (1968), Sorting networks and their applications, Proc. of the Spring Joint Computer Conf., Vol. 32, AFIPS Press.
3. Beighton F. T., (1984), Tight bounds on the complexity of parallel sorting, Proc. of the ACM svm. on Theory of Computing, pp.71–80, ACM.
4. Boyer R. S.,and Moore J. S., (1977), A fast string searching algorithm, Communications of the ACM. 20, 762–772.
5. Smit G. D., (1982), A comparison of three string matching algorithms, Software Practice and Experience, 12, 57–66.