Thomas Watson

Computational complexity theory, and theoretical computer science in general.

I am a postdoctoral research scholar at the University of Toronto. I received my Ph.D. in theoretical computer science from the University of California, Berkeley in May 2013, where my advisor was Luca Trevisan. Here are my curriculum vitae and my dissertation. In 2009 I was awarded an NSF Graduate Research Fellowship. I received my undergraduate degree from the University of Wisconsin - Madison in May 2008, with majors in computer science, mathematics, and computer engineering.

Thomas Watson. The Complexity of Deciding Statistical Properties of Samplable Distributions. STACS 2014.
Thomas Watson. The Complexity of Estimating Min-Entropy. Preprint.
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. Preprint.
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.

CS 70: Discrete Mathematics and Probability Theory, UC Berkeley, Summer 2013
CS 70: Discrete Mathematics and Probability Theory, UC Berkeley, Spring 2012
CS 170: Efficient Algorithms and Intractable Problems, UC Berkeley, Fall 2011

Courses taken at Berkeley and at Madison