Expected time bounds for selection

Cited in

(43)

Randomized selection in \(n+C+o(n)\) comparisons
A Bayesian approach to relevance in game playing
Selection by distributive partitioning
Semantics of probabilistic programs
Expected cost bounds for the selection and ordering procedures based on binary-type questions
Fast linear expected-time algorithms for computing maxima and convex hulls
Sorting in linear time?
Random sampling and greedy sparsification for matroid optimization problems
Exploiting few inversions when sorting: Sequential and parallel algorithms
Architecture independent parallel selection with applications to parallel priority queues
Galton, Edgeworth, Frisch, and prospects for quantile regression in econometrics
The Gaussian hare and the Laplacian tortoise: computability of squared-error versus absolute-error estimators. With comments by Ronald A. Thisted and M. R. Osborne and a rejoinder by the authors
Linear sorting with O(log n) processors
Finding the n-th largest element
A selectable sloppy heap
A time warping approach to multiple sequence alignment
Tardiness bounds under global EDF scheduling on a multiprocessor
On Floyd and Rivest's SELECT algorithm
Some notes on robust sure independence screening
Parallel distributive partitioned sorting methods
Select with groups of 3 or 4
Further analysis of the remedian algorithm
On the median-of-k version of Hoare's selection algorithm
Communication and energy efficient routing protocols for single-hop radio networks
BlockQuicksort: avoiding branch mispredictions in Quicksort
SORTING AND SELECTION ON DISTRIBUTED MEMORY BUS COMPUTERS
Geometric algorithms for the minimum cost assignment problem
Selection Algorithms with Small Groups
In-place linear probing sort
Streaming Algorithms for Selection and Approximate Sorting
EFFICIENT ALGORITHMS FOR SELECTION AND SORTING OF LARGE DISTRIBUTED FILES ON DE BRUIJN AND HYPERCUBE STRUCTURES
Algorithms
Finding a mediocre player
Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses
scientific article; zbMATH DE number 7765400 (Why is no real title available?)
Leveraging parameterized Chernoff bounds for simplified algorithm analyses
Selection from read-only memory and sorting with minimum data movement
Deterministic cache-oblivious funnelselect
Order statistics in large arrays (OSILA): a simple randomised algorithm for a fast and efficient attainment of the order statistics in very large arrays
Hopcroft's problem, log* shaving, two-dimensional fractional cascading, and decision trees
Exponential bounds for the running time of a selection algorithm
Randomized algorithm for the sum selection problem
Weighted median algorithms for \(L_ 1\) approximation

This page was built for publication: Expected time bounds for selection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4050138)