| 2021 | STACS | 6-Uniform Maker-Breaker Game Is PSPACE-Complete. | Md Lutfar Rahman, Thomas Watson |
| 2020 | ICALP | Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity. | Toniann Pitassi, Morgan Shirley, Thomas Watson |
| 2020 | LATIN | Tractable Unordered 3-CNF Games. | Md Lutfar Rahman, Thomas Watson |
| 2019 | ICALP | Amplification with One NP Oracle Query. | Thomas Watson |
| 2019 | STACS | A ZPP | Thomas Watson |
| 2018 | ISAAC | Complexity of Unordered CNF Games. | Md Lutfar Rahman, Thomas Watson |
| 2018 | LATIN | Quadratic Simulations of Merlin-Arthur Games. | Thomas Watson |
| 2017 | FOCS | Query-to-Communication Lifting for BPP. | Mika Gs, Toniann Pitassi, Thomas Watson |
| 2017 | ICALP | Randomized Communication vs. Partition Number. | Mika Gs, T. S. Jayram, Toniann Pitassi, Thomas Watson |
| 2017 | IJCNN | Abstraction hierarchy in deep learning neural networks. | Roman Ilin, Thomas Watson, Robert Kozma |
| 2016 | FOCS | Extension Complexity of Independent Set Polytopes. | Mika Gs, Rahul Jain, Thomas Watson |
| 2016 | ICALP | The Landscape of Communication Complexity Classes. | Mika Gs, Toniann Pitassi, Thomas Watson |
| 2015 | FOCS | Deterministic Communication vs. Partition Number. | Mika Gs, Toniann Pitassi, Thomas Watson |
| 2015 | STOC | Rectangles Are Nonnegative Juntas. | Mika Gs, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman |
| 2014 | STACS | The Complexity of Deciding Statistical Properties of Samplable Distributions. | Thomas Watson |
| 2013 | STACS | Advice Lower Bounds for the Dense Model Theorem. | Thomas Watson |