论文信息 - Theory and Implementation of Online Multiselection Algorithms

Theory and Implementation of Online Multiselection Algorithms

We introduce a new online algorithm for the multiselection problem which performs a sequence of selection queries on a given unsorted array. We show that our online algorithm is 1-competitive in terms of data comparisons. In particular, we match the bounds (up to lower order terms) from the optimal offline algorithm proposed by Kaligosi et al. [ICALP 2005].

[1] David G. Kirkpatrick,et al. The Ultimate Planar Convex Hull Algorithm? , 1986, SIAM J. Comput..

[2] Jean Cardinal,et al. An Efficient Algorithm for Partial Order Production , 2010, SIAM J. Comput..

[3] David P. Dobkin,et al. Optimal Time Minimal Space Selection Algorithms , 1981, JACM.

[4] Amr Elmasry,et al. Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes , 2005, STACS.

[5] S. Srinivasa Rao,et al. Competitive Online Selection in Main and External Memory , 2012, arXiv.org.

[6] C. A. R. Hoare,et al. Algorithm 65: find , 1961, Commun. ACM.

[7] Alok Aggarwal,et al. The input/output complexity of sorting and related problems , 1988, CACM.

[8] Helmut Prodinger,et al. Multiple Quickselect - Hoare's Find Algorithm for Several Elements , 1995, Inf. Process. Lett..

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

[10] Conrado Martínez,et al. Interval Sorting , 2010, ICALP.

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

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

[13] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.

[14] C. A. R. Hoare,et al. Algorithm 64: Quicksort , 1961, Commun. ACM.

[15] Kurt Mehlhorn,et al. Towards Optimal Multiple Selection , 2005, ICALP.