Author:
Alt H.,Hagerup T.,Mehlhorn K.,Preparata F. P.
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. L. Adleman: “Two Theorems on Random Polynomial Time”. Proc. 19'th Symp. Found. of Comp. Sci. (1978), 75–83.
2. M. Ajtai, J. Komlós, E. Szemerédi: “An O(n log n) Sorting Network”. Proc. 15'th ACM Symp. Theory of Comp. (1983), 1–9.
3. K.E. Batcher: “Sorting networks and their applications”. Proc. AFIPS Spring Joint Comp. Conf. 32 (1968), 307–314.
4. A. Borodin, J.E. Hoperoft: “Routing, Merging, and Sorting on Parallel Models of Computation”. Proc. 14'th ACM Symp. Theory of Comp. (1982), 338–344.
5. S. Fortune, J. Wyllie: “Parallelism in Random Access Machines”. Proc. 10'th ACM Symp. Theory of Comp. (1978), 114–118.