| 2008 | SAT | Regular and General Resolution: An Improved Separation. | Alasdair Urquhart |
| 2007 | CSL | Game Characterizations and the PSPACE-Completeness of Tree Resolution Space. | Alexander Hertel, Alasdair Urquhart |
| 2007 | SAT | Formalizing Dangerous SAT Encodings. | Alexander Hertel, Philipp Hertel, Alasdair Urquhart |
| 2006 | TAMC | Width Versus Size in Resolution Proofs. | Alasdair Urquhart |
| 2002 | STOC | An exponential separation between regular and general resolution. | Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart |
| 2001 | STOC | The complexity of analytic tableaux. | Noriko H. Arai, Toniann Pitassi, Alasdair Urquhart |
| 2000 | TABLEAUX | Local Symmetries in Propositional Logic. | Noriko H. Arai, Alasdair Urquhart |
| 1994 | LICS | Upper and Lower Bounds for Tree-Like Cutting Planes Proofs | Russell Impagliazzo, Toniann Pitassi, Alasdair Urquhart |
| 1992 | FOCS | The Complexity of the Hajs Calculus | Toniann Pitassi, Alasdair Urquhart |
| 1989 | STOC | Functional Interpretations of Feasibly Constructive Arithmetic (Extended Abstract) | Stephen A. Cook, Alasdair Urquhart |