Kanela Kaligosi, Kurt Mehlhorn, J. Ian Munro, Peter Sanders  Home/Search
Context
Related
| mpisb.mpg.de/~mehl...multiselection.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mpiinf.mpg.de/~mehlhorn/...node1 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The multiple selection problem asks for the elements of rank r1 , r2 , . . . , rk from a linearly ordered set of n elements. Let B denote the information theoretic lower bound on the number of element comparisons needed for multiple selection. We first show that a variant of multiple quickselect --- a well known, simple, and practical generalization of quicksort --- solves this problem with B + expected comparisons. (Update)
Active bibliography (related documents): More All
0.5: Computational Geometry - Lee (1996) (Correct)
0.4: On the Probabilistic Worst-Case Time of "Find" - Devroye (Correct)
0.4: On the Comparison Cost of Partial Orders - Culberson, Rawlins (1992) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ kaligosi-towards,
author = "Kanela Kaligosi and Kurt Mehlhorn and J. Ian Munro and Peter Sanders",
title = "Towards Optimal Multiple Selection",
url = "citeseer.ist.psu.edu/745265.html" }
Citations (may not include all citations):837 Cambridge University Press (context) - Motwani, Raghavan - 1995
182 A comparison of sorting algorithms for the connection machin.. - Blelloch, Leiserson et al. - 1991
174 Time bounds for selection (context) - Blum, Floyd et al. - 1973
108 Communications of the ACM (context) - Hoare, algorithm - 1961
61 Expected time bounds for selection (context) - Floyd, Rivest - 1975
26 Selecting the median - Dor, Zwick - 1995
19 Average case selection (context) - Cunto, Munro - 1989
11 A sorting problem and its complexity (context) - Pohl - 1972
9 Finding the median (context) - Schonhage, Paterson et al. - 1976
4 A tournament problem (context) - Jr, Johnson - 1959
3 Multiple quickselect - Hoare's find algorithm for several el.. (context) - Prodinger - 1995
2 Optimal time minimal space selection algorithms (context) - Dobkin, Munro - 1981
1 Analysis of multiple quickselect variants (context) - Panholzer - 2003
1 Communications of the ACM (context) - Chambers, algorithm - 1971
Documents on the same site (http://www.mpi-inf.mpg.de/~mehlhorn/Journallist/node1.html): More
Certifying and Repairing Solutions to Large LPs -.. - Dhiflaoui, Funke, .. (Correct)
Implementation of O(nm log n) Weighted Matchings in General.. - Mehlhorn, Schäfer (Correct)
Implementing Minimum Cycle Basis Algorithms - Mehlhorn, Michail (2005) (Correct)
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