| 2024 | SAT | The Strength of the Dominance Rule. | Leszek Aleksander Kolodziejczyk, Neil Thapen |
| 2021 | LICS | First-Order Reasoning and Efficient Semi-Algebraic Proofs. | Fedor Part, Neil Thapen, Iddo Tzameret |
| 2019 | FOCS | Polynomial Calculus Space and Resolution Width. | Nicola Galesi, Leszek Aleksander Kolodziejczyk, Neil Thapen |
| 2019 | SAT | DRAT Proofs, Propagation Redundancy, and Extended Resolution. | Sam Buss, Neil Thapen |
| 2014 | FOCS | Total Space in Resolution. | Ilario Bonacina, Nicola Galesi, Neil Thapen |
| 2013 | ICALP | The Complexity of Proving That a Graph Is Ramsey. | Massimo Lauria, Pavel Pudlk, Vojtech Rdl, Neil Thapen |
| 2013 | MFCS | Parity Games and Propositional Proofs. | Arnold Beckmann, Pavel Pudlk, Neil Thapen |
| 2012 | CiE | How Much Randomness Is Needed for Statistics? | Bjrn Kjos-Hanssen, Antoine Taveneaux, Neil Thapen |
| 2007 | CiE | The Polynomial and Linear Hierarchies in V | Leszek Aleksander Kolodziejczyk, Neil Thapen |
| 2005 | SAT | Resolution and Pebbling Games. | Nicola Galesi, Neil Thapen |
| 2004 | LICS | The Strength of Replacement in Weak Arithmetic. | Stephen A. Cook, Neil Thapen |