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)

Related topics

Related topics

9 relations
Array data structureBead sortBucket queueBucket sort

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Scalable Bias-Resistant Distributed Randomness
Bias-resistant public randomness is a critical component in many (distributed) protocols. Generating public randomness is hard… 
Highly Cited
2002
Highly Cited
2002
Global Constraints for Lexicographic Orderings
We propose some global constraints for lexicographic orderings on vectors of variables. These constraints are very useful for… 
Highly Cited
2000
Highly Cited
2000
Space complexity in propositional calculus
We study space complexity in the framework of propositional proofs. We consider a natural model analogous to Turing machines with… 
Highly Cited
1999
Highly Cited
1999
Space Bounds for Resolution
We introduce a new way to measure the space needed in a resolution refutation of a CNF formula in propositional logic. With the… 
Highly Cited
1997
Highly Cited
1997
Lower bounds for resolution and cutting plane proofs and monotone computations
Abstract We prove an exponential lower bound on the length of cutting plane proofs. The proof uses an extension of a lower bound… 
Review
1989
Review
1989
Volcanic hazards and their mitigation: Progress and problems
At the beginning of the twentieth century, volcanology began to emerge as a modern science as a result of increased interest in… 
Highly Cited
1988
Highly Cited
1988
The complexity of the Pigeonhole Principle
  • M. Ajtai
  • [Proceedings ] 29th Annual Symposium on…
  • 1988
  • Corpus ID: 37226272
The Pigeonhole Principle forn is the statement that there is no one-to-one function between a set of sizen and a set of sizen−1… 
Highly Cited
1985
Highly Cited
1985
The Intractability of Resolution
Highly Cited
1985
Highly Cited
1985
Six standard deviations suffice
Given n sets on n elements it is shown that there exists a two-coloring such that all sets have discrepancy at most Knl/2, K an… 
Highly Cited
1975
Highly Cited
1975
Ramsey's Theorem with Sums or Unions
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)