Skip to search formSkip to main contentSkip to account menu

Selection algorithm

Known as: Hoare's algorithm, Select algorithm, Selection problem 
In computer science, a selection algorithm is an algorithm for finding the kth smallest number in a list or array; such a number is called the kth… 
Wikipedia (opens in a new tab)

Related topics

Related topics

42 relations
AlgorithmAmortized analysisArray data structureC++

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Schedulability Analysis for Hard Network Lifetime Wireless Sensor Networks With High Energy First Clustering
Network lifetime predictability is an essential system requirement for the type of wireless sensor network (WSN) used in safety… 
Highly Cited
2008
Highly Cited
2008
Greedy regression ensemble selection: Theory and an application to water quality prediction
Highly Cited
2006
Highly Cited
2006
Accepted for publication in ApJ Preprint typeset using L ATEX style emulateapj v. 6/22/04 QUASARS IN THE COSMOS FIELD
  • 2006
  • Corpus ID: 15071537
Highly Cited
2004
Highly Cited
2004
Genetic algorithms combined with discriminant analysis for key variable identification
Highly Cited
2004
Highly Cited
2004
On the capacity of broadband relay networks
  • Guoqing LiHui Liu
  • Conference Record of the Thirty-Eighth Asilomar…
  • 2004
  • Corpus ID: 16628350
This paper studies a broadband relay network model with multiple source nodes, multiple relay nodes and a single destination node… 
Highly Cited
2003
Highly Cited
2003
A homogeneous sample of sub-damped Lyman α systems- I. Construction of the sample and chemical abundance measurements
In this first paper of a series, we report on the use of quasar spectra obtained with the high-resolution Ultraviolet-Visual… 
Highly Cited
2003
Highly Cited
2003
MIRAI: a solution to seamless access in heterogeneous wireless networks
A key word describing next-generation wireless communications, so called 4G, is "seamless". As part of the e-Japan plan promoted… 
Review
1988
Review
1988
Module selection for pipelined synthesis
module selection is the process of choosing the types of modules (e.g. carry-look-ahead adder) to implement each operation (e.g… 
Highly Cited
1987
Highly Cited
1987
Design of resilient processing plants-IX. Effect of model uncertainty on dynamic resilience
Highly Cited
1979
Highly Cited
1979
A Counting Approach to Lower Bounds for Selection Problems
Lower bounds are derived on the number of comparisons to solve several well-known selection problems Among the problems are… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)