### 10 papers:

- LICS-CSL-2014-Das #on the
- On the pigeonhole and related principles in deep inference and monotone systems (AD), p. 10.
- STOC-2002-Raz02a #bound #principle
- Resolution lower bounds for the weak pigeonhole principle (RR), pp. 553–562.
- STOC-2001-PitassiR #bound #principle
- Regular resolution lower bounds for the weak pigeonhole principle (TP, RR), pp. 347–355.
- DLT-2001-Razborov #complexity #proving
- Proof Complexity of Pigeonhole Principles (AAR), pp. 100–116.
- ICALP-2001-AtseriasBE #bound
- Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution (AA, MLB, JLE), pp. 1005–1016.
- STOC-2000-MacielPW #principle #proving
- A new proof of the weak pigeonhole principle (AM, TP, ARW), pp. 368–377.
- STOC-1997-RazborovWY #branch #calculus #proving #source code
- Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus (AAR, AW, ACCY), pp. 739–748.
- CSL-1997-BussP #principle
- Resolution and the Weak Pigeonhole Principle (SRB, TP), pp. 149–156.
- KR-1996-SmirnovV #contest #integer #performance #programming #representation
- Efficiency Competition through Representation Changes: Pigeonhole Principle vs. Integer Programming Methods (YVS, MMV), pp. 124–134.
- STOC-1992-BeameIKPPW #bound #exponential #principle
- Exponential Lower Bounds for the Pigeonhole Principle (PB, RI, JK, TP, PP, ARW), pp. 200–220.