Lower Bounds for Selection in X + Y and Other Multisets
Journal of the ACM (JACM)
A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort
Journal of the ACM (JACM)
A Counting Approach to Lower Bounds for Selection Problems
Journal of the ACM (JACM)
On the complexity of computing the measure of ∪[ai,bi]
Communications of the ACM
Implicit data structures (Preliminary Draft)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
An Efficient Algorithm for the Approximate Median Selection Problem
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Ranking information in networks
SBP'11 Proceedings of the 4th international conference on Social computing, behavioral-cultural modeling and prediction
FLEX: a slot allocation scheduling optimizer for MapReduce workloads
Proceedings of the ACM/IFIP/USENIX 11th International Conference on Middleware
| Hi-index | 0.00 |
Selection in a set requires time linear in the size of the set when there are no a priori constraints on the total orders possible for the set. Constraints often come for free, however, with sets which arise in applications. Linear time selection [Bl] can be suboptimal for such problems. We therefore generalize the well known selection problem to admit constraints on the input sets, with a view toward settling the complexity issues which arise. The generalization also applies to the other quantile problems of ranking a given element in the input set and verification of the claim that a given element has a specified rank.