Skip to search formSkip to main contentSkip to account menu

Pigeonhole sort

Known as: Count sort, Pigeonhole 
Pigeonhole sorting is a sorting algorithm that is suitable for sorting lists of elements where the number of elements (n) and the length of the range… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We study the space complexity of the cutting planes proof system, in which the lines in a proof are integral linear inequalities… 
2013
2013
The class \(\mathcal{SLUR}\) (Single Lookahead Unit Resolution) was introduced in [22] as an umbrella class for efficient SAT… 
2012
2012
The use of classical logic for some combinatorial proofs, as it is the case with Ramsey’s theorem, can be localized in the… 
2003
2003
  • A. Meystel
  • 2003
  • Corpus ID: 206794448
Decision support systems gain better performance and higher accuracy by the virtue of building multiresolutional (multigranular… 
2002
2002
  • Eli Ben-Sasson
  • 2002
  • Corpus ID: 5720641
We prove exponential lower bounds on the size of a bounded depth Frege proof of a Tseitin graph-based contradiction, whenever the… 
1996
1996
  • 1996
  • Corpus ID: 68744028
This volume investigates the introduction of Western music into the educational system of Japan and reveals the existence of… 
Highly Cited
1992
Highly Cited
1992
Many classes of reasoning problems display a large amount of symmetry. In mathematical and common-sense reasoning, such… 
1986
1986
Statistical Data Analysis(SDA)is considered to be aprocess which extracts some“productive”findings from data through certain…