1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, 1974.
2. M. Atallah, R. Cole, and M. Goodrich, “Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms,” 28th IEEE Symp. on Found. of Comp. Sci., 151–160 (1987).
3. G. Bilardi and A. Nicolau, “Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared Memory Machines,” TR 86-769, Dept. of Comp. Sci., Cornell Univ., August 1986.
4. R. Cole, “Parallel Merge Sort,” 27th IEEE Symp. on Found. of Comp. Sci., 1986, 511–516.
5. E. Dekel and S. Sahni, “Binary Trees and Parallel Scheduling Algorithms”, IEEE Trans. on Computers, 307–315, March 1983.