Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2004
Highly Cited
2004
Effcient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
North American archaeologists have spent much effort debating whether Early Paleoindian foragers were specialized hunters of… Expand
  • table 1
  • table 1
  • figure 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We propose some global constraints for lexicographic orderings on vectors of variables. These constraints are very useful for… Expand
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1997
Highly Cited
1997
A proof of the (propositional) Craig interpolation theorem for cut-free sequent calculus yields that a sequent with a cut-free… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We study the complexity of cutting planes (CP) refutations, and tree-like CP refutations. Tree-like CP proofs are natural and… Expand
Is this relevant?
Highly Cited
1988
Highly Cited
1988
  • M. Ajtai
  • [Proceedings ] 29th Annual Symposium on…
  • 1988
  • Corpus ID: 37226272
The pigeonhole principle for n is the statement that there is no one-to-one function between a set of size n and a set of size n… Expand
Is this relevant?
Highly Cited
1987
Highly Cited
1987
  • S. Buss
  • J. Symb. Log.
  • 1987
  • Corpus ID: 120725194
Cook and Reckhow defined a propositional formulation of the pigeonhole principle. This paper shows that there are Frege proofs of… Expand
Is this relevant?
Highly Cited
1985
Highly Cited
1985
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… Expand
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Abstract We prove that, for infinitely many disjunctive normal form propositional calculus tautologies ξ, the length of the… Expand
Is this relevant?
Highly Cited
1975
Highly Cited
1975
Abstract Using Hindman's theorem as a strong pigeonhole principle, we prove strengthened versions of Ramsey's theorem and of… Expand
Is this relevant?