1. The Design and Analysis of Computer Algorithms;Aho,1974
2. Parallel Complexity of Sorting Algorithms;Aigner;Journal of Algorithms,1982
3. M. Ajtai J. Komlos E. Szemeredi,〉 An 0(n log n) Sorting Network〉, Proceedings of the 15th Annual Symposium on Theory of Computing, 1-9, 1983.
4. An Optimal Algorithm for Parallel Selection;Akl,1984
5. F. André, P. Frison P. Quinton 〈Algorithmes Systoliques: de la Théorie á la Pratique 〈, Rapport de Recherche no. 214, 1NR1A, Rennes, France, 1983.