• | Thomas Watson. Amplification with One NP Oracle Query. Preprint. |

• | Md Lutfar Rahman and Thomas Watson. Complexity of Unordered CNF Games. ISAAC 2018. |

• | Thomas Watson. A ZPP^{NP[1]} Lifting Theorem. STACS 2019. |

• | Mika Göös, Toniann Pitassi, and Thomas Watson. Query-to-Communication Lifting for BPP. FOCS 2017. |

• | Mika Göös, Pritish Kamath, Toniann Pitassi, and Thomas Watson. Query-to-Communication Lifting for P^{NP}. CCC 2017. |

• | Thomas Watson. Quadratic Simulations of Merlin-Arthur Games. LATIN 2018. |

• | Thomas Watson. Communication Complexity of Statistical Distance. RANDOM 2017. |

• | Thomas Watson. Communication Complexity with Small Advantage. CCC 2018. |

• | Mika Göös, Rahul Jain, and Thomas Watson. Extension Complexity of Independent Set Polytopes. FOCS 2016. |

• | Mika Göös, T.S. Jayram, Toniann Pitassi, and Thomas Watson. Randomized Communication vs. Partition Number. ICALP 2017. |

• | Mika Göös, Toniann Pitassi, and Thomas Watson. Deterministic Communication vs. Partition Number. FOCS 2015. |

• | Mika Göös, Toniann Pitassi, and Thomas Watson. The Landscape of Communication Complexity Classes. ICALP 2016. |

• | Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, and David Zuckerman. Rectangles Are Nonnegative Juntas. STOC 2015. |

• | Mika Göös, Toniann Pitassi, and Thomas Watson. Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. ITCS 2015. |

• | Mika Göös and Thomas Watson. Communication Complexity of Set-Disjointness for All Probabilities. RANDOM 2014. |

• | Thomas Watson. Nonnegative Rank vs. Binary Rank. CJTCS 2016. |

• | Thomas Watson. The Complexity of Deciding Statistical Properties of Samplable Distributions. STACS 2014. |

• | Thomas Watson. The Complexity of Estimating Min-Entropy. CC 2016. |

• | Thomas Watson. Time Hierarchies for Sampling Distributions. ITCS 2013. |

• | Thomas Watson. Advice Lower Bounds for the Dense Model Theorem. STACS 2013. |

• | Thomas Watson. Lift-and-Project Integrality Gaps for the Traveling Salesperson Problem. CJTCS 2014. |

• | Anindya De and Thomas Watson. Extractors and Lower Bounds for Locally Samplable Sources. RANDOM 2011. |

• | Thomas Watson. Pseudorandom Generators for Combinatorial Checkerboards. CCC 2011. |

• | Thomas Watson. Query Complexity in Errorless Hardness Amplification. RANDOM 2011. |

• | Thomas Watson. Relativized Worlds Without Worst-Case to Average-Case Reductions for NP. RANDOM 2010. |

• | Dieter van Melkebeek and Thomas Watson. Time-Space Efficient Simulations of Quantum Computations. TOC 2012. |