H. Prodinger. Multiple quickselect - Hoare's find algorithm for several elements. Information Processing Letters, 56:123--129, 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On the Probabilistic Worst-Case Time of "Find" - Devroye (Correct)
....(m 1,m 1) distributed. For related work, see Kirschenhofer, Prodinger and Martinez (1997) Finally, to search for several order statistics, one may turn to multiple quickselect, a generalization of Hoare s method. It was analyzed by Mahmoud and Smythe (1998) Panholzer and Prodinger (1998) and Prodinger (1995). Its worst case properties (over all combinations of m order statistics) should be studied. Acknowledgment I would like to thank both referees for a thorough reading of the paper, and for pointing out some interesting references. Thanks are also due to Ralph Neininger for valuable comments. 14 ....
H. Prodinger, "Multiple Quickselect---Hoare's Find algorithm for several elements," Information Processing Letters, vol. 56, pp. 123--129, 1995.
Towards Optimal Multiple Selection - Kaligosi, Mehlhorn, Munro, Sanders (Correct)
No context found.
H. Prodinger. Multiple quickselect - Hoare's find algorithm for several elements. Information Processing Letters, 56:123--129, 1995.
Distances and Finger Search in Random Binary Search Trees - Devroye, Neininger (2003) (Correct)
No context found.
Prodinger, H. (1995) Multiple Quickselect|Hoare's Find algorithm for several elements. Inform. Process. Lett. 56, 123-129.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC