A Quantum Time-Space Lower Bound for the Counting Hierarchy. - Dieter van Melkebeek; Thomas Watson 001 (Electron. Colloquium Comput. Complex., 2008)

Time-Space Efficient Simulations of Quantum Computations. - Dieter van Melkebeek; Thomas Watson 001 (Electron. Colloquium Comput. Complex., 2010)

Relativized Worlds Without Worst-Case to Average-Case Reductions for NP. - Thomas Watson 001 (Electron. Colloquium Comput. Complex., 2010)

Extractors and Lower Bounds for Locally Samplable Sources. - Anindya De; Thomas Watson 001 (Electron. Colloquium Comput. Complex., 2011)

Advice Lower Bounds for the Dense Model Theorem. - Thomas Watson 001 (Electron. Colloquium Comput. Complex., 2011)

Pseudorandom generators for combinatorial checkerboards. - Thomas Watson 001 (Comput. Complex., 2013)

The Complexity of Deciding Statistical Properties of Samplable Distributions. - Thomas Watson 001 (Electron. Colloquium Comput. Complex., 2013)

The Computational Complexity of Randomness. - Thomas Weir Watson (2013)

Lift-and-Project Integrality Gaps for the Traveling Salesperson Problem. - Thomas Watson 001 (Chic. J. Theor. Comput. Sci., 2014)

Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. - Mika Göös; Toniann Pitassi; Thomas Watson 001 (Electron. Colloquium Comput. Complex., 2014)

Communication Complexity of Set-Disjointness for All Probabilities. - Mika Göös; Thomas Watson 001 (Electron. Colloquium Comput. Complex., 2014)

Time Hierarchies for Sampling Distributions. - Thomas Watson 001 (SIAM J. Comput., 2014)

Query Complexity in Errorless Hardness Amplification. - Thomas Watson 001 (Comput. Complex., 2015)

Randomized Communication vs. Partition Number. - Mika Göös; T. S. Jayram; Toniann Pitassi; Thomas Watson 001 (Electron. Colloquium Comput. Complex., 2015)

The complexity of estimating min-entropy. - Thomas Watson 001 (Comput. Complex., 2016)

Nonnegative Rank vs. Binary Rank. - Thomas Watson 001 (Chic. J. Theor. Comput. Sci., 2016)

Communication Complexity of Statistical Distance. - Thomas Watson 001 (Electron. Colloquium Comput. Complex., 2016)

Rectangles Are Nonnegative Juntas. - Mika Göös; Shachar Lovett; Raghu Meka; Thomas Watson 001; David Zuckerman (SIAM J. Comput., 2016)

Quadratic Simulations of Merlin-Arthur Games. - Thomas Watson 001 (Electron. Colloquium Comput. Complex., 2017)

A ZPP^NP[1] Lifting Theorem. - Thomas Watson 001 (Electron. Colloquium Comput. Complex., 2017)

The Landscape of Communication Complexity Classes. - Mika Göös; Toniann Pitassi; Thomas Watson 001 (Comput. Complex., 2018)

Complexity of Unordered CNF Games. - Md Lutfar Rahman; Thomas Watson 001 (Electron. Colloquium Comput. Complex., 2018)

Extension Complexity of Independent Set Polytopes. - Mika Göös; Rahul Jain 001; Thomas Watson 001 (SIAM J. Comput., 2018)

Deterministic Communication vs. Partition Number. - Mika Göös; Toniann Pitassi; Thomas Watson 001 (SIAM J. Comput., 2018)

Randomized Communication versus Partition Number. - Mika Göös; T. S. Jayram; Toniann Pitassi; Thomas Watson 001 (ACM Trans. Comput. Theory, 2018)

Query-to-Communication Lifting for P NP. - Mika Göös; Pritish Kamath; Toniann Pitassi; Thomas Watson 001 (Comput. Complex., 2019)

Correction to: Query-to-Communication Lifting for P NP. - Mika Göös; Pritish Kamath; Toniann Pitassi; Thomas Watson 001 (Comput. Complex., 2019)

Tractable Unordered 3-CNF Games. - Md Lutfar Rahman; Thomas Watson 001 (Electron. Colloquium Comput. Complex., 2019)

A Lower Bound for Sampling Disjoint Sets. - Thomas Watson 001 (Electron. Colloquium Comput. Complex., 2019)

When Is Amplification Necessary for Composition in Randomized Query Complexity? - Shalev Ben-David; Mika Göös; Robin Kothari; Thomas Watson 001 (APPROX-RANDOM, 2020)

Communication Complexity with Small Advantage. - Thomas Watson 001 (Comput. Complex., 2020)

Correction to: Communication complexity with small advantage. - Thomas Watson 001 (Comput. Complex., 2020)

6-Uniform Maker-Breaker Game Is PSPACE-Complete. - Md Lutfar Rahman; Thomas Watson 001 (Electron. Colloquium Comput. Complex., 2020)

Query-to-Communication Lifting for BPP. - Mika Göös; Toniann Pitassi; Thomas Watson 001 (SIAM J. Comput., 2020)

A Lower Bound for Sampling Disjoint Sets. - Mika Göös; Thomas Watson 001 (ACM Trans. Comput. Theory, 2020)

A ZPPNP[1] Lifting Theorem. - Thomas Watson 001 (ACM Trans. Comput. Theory, 2020)

Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity. - Toniann Pitassi; Morgan Shirley; Thomas Watson 001 (Comput. Complex., 2021)

Complexity of Fault Tolerant Query Complexity. - Ramita Maharjan; Thomas Watson 001 (FSTTCS, 2022)

Erdős-Selfridge Theorem for Nonmonotone CNFs. - Md Lutfar Rahman; Thomas Watson 001 (SWAT, 2022)

Amplification with One NP Oracle Query. - Thomas Watson 001 (Comput. Complex., 2022)