Article
Licensed
Unlicensed
Requires Authentication
A random algorithm for multiselection
-
M. H. Alsuwaiyel
Published/Copyright:
March 1, 2006
Given a set S of n elements drawn from a linearly ordered set and a set K = {k1, k2, . . . , kr} of positive integers between 1 and n, the multiselection problem is to select the ki th smallest element for all values of i, 1 ≤ i ≤ r. We present an efficient randomised algorithm to solve this problem in time O(n log r) with probability at least 1−cn−1, where c is a positive constant.
Published Online: 2006-03-01
Published in Print: 2006-03-01
Copyright 2006, Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Testing numbers of the form N = 2kpm − 1 for primality
- On a two-dimensional binary model of a financial market and its extension
- Stochastic optimality in the problem on linear regulator perturbed by a sequence of dependent random variables
- On large deviations of branching processes in a random environment: geometric distribution of descendants
- A random algorithm for multiselection
- On the mean complexity of monotone functions
- On reliability of circuits over the basis {x ∨ y ∨ z, x & y & z, } under single-type constant faults at inputs of elements
Articles in the same Issue
- Testing numbers of the form N = 2kpm − 1 for primality
- On a two-dimensional binary model of a financial market and its extension
- Stochastic optimality in the problem on linear regulator perturbed by a sequence of dependent random variables
- On large deviations of branching processes in a random environment: geometric distribution of descendants
- A random algorithm for multiselection
- On the mean complexity of monotone functions
- On reliability of circuits over the basis {x ∨ y ∨ z, x & y & z, } under single-type constant faults at inputs of elements
