Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Akers, S., Harel, D. and Krishnamurthy, B.: The Star Graph: An Attractive Alternative to the n-Cube. Proc. International Conference of Parallel Processing, 1987, pp. 393–400.
2. Aleliunas, R.: Randomized parallel communication. Proc. Symposium on Principles of Distributed Computing, 1982, pp. 60–72.
3. Borodin, A. and J. E. Hopcroft: Routing, merging and sorting on parallel models of computation. Proc. Symposium on Theory of Computing, 1982, pp. 338–344.
4. Hoare C.A.R.: Quicksort. Computer Journal, vol. 5, no. 1, 1962, pp. 10–15.
5. Karp, R. and Ramachandran, V.: Parallel Algorithms for Shared-Memory Machines. in Handbook of Theoretical Computer Science, North-Holland, 1990.