Follow
Thomas Watson
Thomas Watson
Associate Professor of Computer Science, University of Memphis
Verified email at memphis.edu - Homepage
Title
Cited by
Cited by
Year
Deterministic Communication vs. Partition Number
M Göös, T Pitassi, T Watson
Proceedings of the 56th Symposium on Foundations of Computer Science (FOCS …, 2015
1582015
Rectangles Are Nonnegative Juntas
M Göös, S Lovett, R Meka, T Watson, D Zuckerman
Proceedings of the 47th Symposium on Theory of Computing (STOC), 257-266, 2015
1292015
Query-to-Communication Lifting for BPP
M Göös, T Pitassi, T Watson
Proceedings of the 58th Symposium on Foundations of Computer Science (FOCS …, 2017
1092017
Rectangles Are Nonnegative Juntas
M Göös, S Lovett, R Meka, T Watson, D Zuckerman
SIAM Journal on Computing 45 (5), 1835-1869, 2016
712016
The Landscape of Communication Complexity Classes
M Göös, T Pitassi, T Watson
Computational Complexity 27 (2), 245-304, 2018
622018
The Landscape of Communication Complexity Classes
M Göös, T Pitassi, T Watson
Proceedings of the 43rd International Colloquium on Automata, Languages, and …, 2016
622016
Extension Complexity of Independent Set Polytopes
M Göös, R Jain, T Watson
Proceedings of the 57th Symposium on Foundations of Computer Science (FOCS …, 2016
572016
Randomized Communication vs. Partition Number
M Göös, TS Jayram, T Pitassi, T Watson
ACM Transactions on Computation Theory 10 (1), 4:1-4:20, 2018
48*2018
Deterministic Communication vs. Partition Number
M Göös, T Pitassi, T Watson
SIAM Journal on Computing 47 (6), 2435-2450, 2018
482018
Randomized Communication vs. Partition Number
M Göös, TS Jayram, T Pitassi, T Watson
Proceedings of the 44th International Colloquium on Automata, Languages, and …, 2017
48*2017
Extension Complexity of Independent Set Polytopes
M Göös, R Jain, T Watson
SIAM Journal on Computing 47 (1), 241-269, 2018
422018
Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication
M Göös, T Pitassi, T Watson
Proceedings of the 6th Innovations in Theoretical Computer Science …, 2015
332015
Time-Space Efficient Simulations of Quantum Computations
D van Melkebeek, T Watson
Theory of Computing 8 (1), 1-51, 2012
292012
Query-to-Communication Lifting for P^NP
M Göös, P Kamath, T Pitassi, T Watson
Computational Complexity 28 (1), 113-144, 2019
282019
Query-to-Communication Lifting for P^NP
M Göös, P Kamath, T Pitassi, T Watson
Proceedings of the 32nd Computational Complexity Conference (CCC), 12:1-12:16, 2017
282017
Extractors and Lower Bounds for Locally Samplable Sources
A De, T Watson
ACM Transactions on Computation Theory 4 (1), 3:1-3:21, 2012
272012
6-Uniform Maker-Breaker Game Is PSPACE-Complete
ML Rahman, T Watson
Combinatorica 43 (3), 595-612, 2023
262023
6-Uniform Maker-Breaker Game Is PSPACE-Complete
ML Rahman, T Watson
Proceedings of the 38th International Symposium on Theoretical Aspects of …, 2021
262021
Communication Complexity of Set-Disjointness for All Probabilities
M Göös, T Watson
Proceedings of the 18th International Workshop (Conference) on Randomization …, 2014
212014
The Complexity of Estimating Min-Entropy
T Watson
Computational Complexity 25 (1), 153-175, 2016
172016
The system can't perform the operation now. Try again later.
Articles 1–20