Exploiting few inversions when sorting: Sequential and parallel algorithms

Theoretical Computer Science

Volumn 163, Issue 1-2, 1996, Pages 211-238

  Levcopoulos, Christos ^a   Petersson, Ola ^b  

^a LUND UNIVERSITY   (Sweden)

^b LINNAEUS UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

INVERSE PROBLEMS; PARALLEL ALGORITHMS; PROBLEM SOLVING;

INPUT SEQUENCE; PRESORTEDNESS; SEQUENTIAL ALGORITHMS;

COMPUTATION THEORY;

EID: 0030214498     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00256-1     Document Type: Article

References (24)

1. M. Ajtai, J. Komlós and E. Szemeredi, Sorting in c log n parallel steps, Combinatorica 3 (1983) 1-19.
2. T. Altman and B.S. Chlebus, Sorting roughly sorted sequences in parallel, Inform. Process. Lett. 33 (1990) 297-300.
3. G. Bilardi and A. Nicolau, adaptive bitonic sorting: An optimal parallel algorithm for shared memory models, SIAM J. Comput. 18 (1989) 216-228.
4. J. Chen and S. Carlsson, An Optimal parallel adaptive sorting algorithm, Inform. Process. Lett. 39 (1991) 195-200.
5. J. Chen and C. Levcopoulos, Improved parallel sorting of presorted files, in: Proc. Joint Conf. on Vector and Parallel Processing, Lecture Notes in Computer Science, Vol. 634 (Springer, Berlin, 1992) 539-544.
6. R. Cole, Parallel merge sort, SIAM J. Comput. 17 (1988) 770-785.
7. R. Cole and U. Vishkin, Approximate parallel scheduling. Part 1: The basic technique with applications to optimal parallel list ranking in logarithmic time, SIAM J. Comput. 17 (1988) 128-142.
8. E.W. Dijkstra, Smoothsort, an alternative to sorting in situ, Sci. Comput. Programming 1 (1982) 223-233.
9. R.W. Floyd AND R.L. Rivest, Expected time bounds for selection, Comm. ACM 18 (1975) 165-172.
10. L.J. Guibas, E.M. McCreight, M.F. Plass and J.R. Roberts, A new representation of linear lists, in: Proc. 9th Ann. ACM Symp. on Theory of Computing (1977) 49-60.
11. T. Hagerup and C. Rüb, A guided tour of Chernoff bounds, Inform. Process. Lett. 33 (1989) 305-308.
12. S. HERTEL, Smoothsort's behaviour on presorted sequences, Inform. Process. Lett. 16 (1983) 165-170.
13. B.-C. Huang and M.A. Langston, Practical in-place merging, Comm. ACM, 31 (1988) 348-352.
14. J. JÁJÁ, An Introduction to Parallel Algorithms (Addison-Wesley, Reading, MA, 1992).
15. D.E. Knuth, The Art of Computer Programming, Vol. 3: Sorting and Searching (Addition-Wesley, Reading, MA, 1973).
16. T.W. Lai and D. Wood, Implicit selection, in: Proc. 1st Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, Vol. 318 (Springer, Berlin, 1988) 14-23.
17. C. Levcopoulos and O. Petersson, A note on adaptive parallel sorting, Inform. Process. Lett. 33 (1989) 187-191.
18. C. Levcopoulos and O. Petersson, Splitsort - an adaptive sorting algorithm. Inform. Process. Lett. 39 (1991) 205-211.
19. C. Levcopoulos and O. Petersson, Adaptive Heapsort, J. Algorithms 14 (1993) 395-413.
20. H. Mannila, Measures of presortedness and optimal sorting algorithms, IEEE Trans. Comput. C-34 (1985) 318-325.
21. K. Mehlhorn, Data Structures and Algorithms, Vol. 1: Sorting and Searching (Springer, Berlin, 1984).
22. 2 n) time, J. Comput. System. Sci. 33 (1986) 66-74.
23. O. Petersson and A.M. Moffat, A framework for adaptive sorting, Discrete Applied Math., to appear. Prel. version in Proc. 3rd Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, Vol. 621 (Springer, Berlin, 1992) 422-433.
24. O. Petersson and A.M. Moffat, A framework for adaptive sorting, Discrete Applied Math., to appear. Prel. version in Proc. 3rd Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, Vol. 621 (Springer, Berlin, 1992) 422-433.