5 citations · 10 across the 4 of their papers we have counts for
5 papers · 1 filter
Improved randomized selection
Krzysztof C. Kiwiel
We show that several versions of Floyd and Rivest's improved algorithm Select for finding the th smallest of elements require at most …
Randomized selection with tripartitioning
Krzysztof C. Kiwiel
We show that several versions of Floyd and Rivest's algorithm Select [Comm.\ ACM {\bf 18} (1975) 173] for finding the th smallest of elements require at most $n+\min\{k,n-k\…
Randomized selection with quintary partitions
Krzysztof C. Kiwiel
We show that several versions of Floyd and Rivest's algorithm Select for finding the th smallest of elements require at most comparisons on average an…
Partitioning schemes for quicksort and quickselect
Krzysztof C. Kiwiel
We introduce several modifications of the partitioning schemes used in Hoare's quicksort and quickselect algorithms, including ternary schemes which identify keys less or greater t…
Randomized selection revisited
Krzysztof C. Kiwiel
We show that several versions of Floyd and Rivest's algorithm Select for finding the th smallest of elements require at most comparisons on average an…