Selection from read-only memory and sorting with minimum data movement

Theoretical Computer Science

Volumn 165, Issue 2, 1996, Pages 311-323

  Munro, J Ian ^a   Raman, Venkatesh ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA STORAGE EQUIPMENT; ROM; SORTING;

AVERAGE CASE ALGORITHM; DATA EXCHANGES; WORST CASE ALGORITHM;

DATA HANDLING;

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

References (14)

1. M. Blum, R.W. Floyd, V.R. Pratt, R.L. Rivest and R.E. Tarjan, Time bounds for selection, J. Comput. System Sci. 7 (1973) 448-461.
2. D. Dor and U. Zwick, Selecting the median, in: Proc. 6th ACM-SIAM Symp. on Discrete Algorithms (1995) 28-37.
3. R.W. Floyd and R. Rivest, Expected time bounds for selection, Comm. ACM 18(3) (1975) 165-172.
4. G.N. Frederickson, Upper bounds for time-space trade-offs in sorting and selection, J. Comput. System Sci. 34 (1987) 19-26.
5. C.A.R. Hoare, Algorithms 64 PARTITION and Algorithm 65 FIND, Comm. ACM 4 (1961) 321.
6. N.L. Johnson and S. Kotz, Urn Models And Their Application, An Approach to Modern Discrete Probability Theory (Wiley, New York, 1977).
7. D.E. Knuth, The Art of Computer Programming. Volume III: Sorting and Searching (Addison-Wesley, Reading, MA, 1973).
8. D.E. Knuth, Mathematical analysis of algorithms, in: C.V. Frieman, ed., Proc. I.F.I.P. Congress (North-Holland, Amsterdam, 1972) 19-27.
9. J.I. Munro and M.S. Paterson, Selection and sorting with limited storage, Theoret. Comput. Sci. 12 (1980) 315-323.
10. J.I. Munro and V. Raman, Sorting with minimum data movement, J. Algorithms 13 (1992) 374-393.
11. J.I. Munro and V. Raman, Selection from read-only memory and sorting with optimum data movement, in: Proc. 12th FST & TCS Conf., Lecture Notes in Computer Science, Vol. 652 (Springer, Berlin, 1992) 380-391.
12. J.I. Munro and V. Raman, Fast stable in-place sorting with O(n) data moves, Algorithmica, to appear.
13. V. Raman, Sorting in-place with minimum data movement, Ph.D. Thesis, Dept. of Computer Sci., Univ. Waterloo, CS-91-12, 1991.
14. A. Schönhage, M. Paterson and N. Pippenger, Finding the median, J. Comput. System Sci. 13 (1976) 184-199.