Improved Upper Bounds for Time-Space Trade-offs for Selection

We consider the problem of finding an element of a given rank in a totally ordered set given in a read-only array, using limited extra storage cells. We give new algorithms for various ranges of extra space. Our upper bounds improve the previously known bounds in the range of space s such that s is o(lg2 n) and s ≥ (1 + e) lg lg n/ lg lg lg n for any positive constant e < 1. We also give faster rank sensitive algorithms. These algorithms are quite efficient for finding small ranks and their runtime match the upper bound of the best known algorithms when median element is to be found.

[1]  Uri Zwick,et al.  Selecting the median , 1995, SODA '95.

[2]  Manuel Blum,et al.  Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[3]  J. Ian Munro,et al.  Selection and sorting with limited storage , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[4]  Venkatesh Raman,et al.  Selection from Read-Only Memory and Sorting with Minimum Data Movement , 1996, Theor. Comput. Sci..

[5]  Arnold Schönhage,et al.  Finding the Median , 1976, J. Comput. Syst. Sci..

[6]  Greg N. Frederickson,et al.  Upper Bounds for Time-Space Trade-Offs in Sorting and Selection , 1987, J. Comput. Syst. Sci..

[7]  Ronald L. Rivest,et al.  Expected time bounds for selection , 1975, Commun. ACM.

[8]  Theis Rauhe,et al.  Optimal time-space trade-offs for sorting , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).