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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2004
2004
We show that short bounded-depth Frege proofs of matrix identities, such as PQ = I ⊃ QP = I (over the field of two elements… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We give simple new lower bounds on the lengths of Resolution proofs for the pigeonhole principle and for randomly generated… (More)
Is this relevant?
1994
1994
Constraint satisfaction problems (CSP's) involve nding values for variables subject to constraints on which combinations of… (More)
  • figure 1
  • figure 2
  • figure 8
Is this relevant?
Highly Cited
1993
Highly Cited
1993
1 I n t r o d u c t i o n Constraint satisfaction problems (CSP) are a class of combinatorial problems that can be solved… (More)
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Press are collaborating with JSTOR to digitize, preserve and extend access to The Journal of Symbolic Logic. JSTOR is a not-for… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
A parallel algorithm is presented that accepts as input a graph <italic>G</italic> and produces a maximal independent set of… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
We prove that, for infinitely many disjunctive normal form propositional calculus tautologies ~:, the length of the shortest… (More)
Is this relevant?