Sorting roughly sorted sequences in parallel
References (16)
- et al.
Routing, merging and sorting on parallel models of computation
J. Comput. System Sci.
(1985) - et al.
An (n log n) sorting network
Combinatorica
(1983) - et al.
Tight complexity bounds for parallel comparison sorting
Proc. 27th Ann. IEEE Symp. on Foundations of Computer Science
(1986) - et al.
Roughly sorting: sequential and parallel approach
J. Inform. Process.
(1989) - et al.
Tight comparison bounds on the complexity of parallel sorting
SIAM J. Comput.
(1987) Limits on the power of concurrent-write parallel machines
Proc. 18th Ann. ACM Symp. on Theory of Computing
(1986)- et al.
Efficient simulations between concurrent-read concurrent-write PRAM models
Parallel merge sort
SIAM J. Comput.
(1988)
There are more references available in the full text version of this article.
Cited by (5)
Exploiting few inversions when sorting: Sequential and parallel algorithms
1996, Theoretical Computer ScienceAn optimal parallel adaptive sorting algorithm
1991, Information Processing LettersComputing and ranking measures of presortedness
1992, International Journal of Computer MathematicsImproved parallel sorting of presorted sequences
1992, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Copyright © 1990 Published by Elsevier B.V.