Obserwuj
Thomas Watson
Thomas Watson
Assistant Professor of Computer Science, University of Memphis
Zweryfikowany adres z memphis.edu - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Deterministic Communication vs. Partition Number
M Göös, T Pitassi, T Watson
Proceedings of the 56th Symposium on Foundations of Computer Science (FOCS …, 2015
1322015
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
1162015
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
862017
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
Rectangles Are Nonnegative Juntas
M Göös, S Lovett, R Meka, T Watson, D Zuckerman
SIAM Journal on Computing 45 (5), 1835-1869, 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
432016
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
42*2018
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
42*2017
Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication
M Göös, T Pitassi, T Watson
Algorithmica 76 (3), 684-719, 2016
322016
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
322015
Extension Complexity of Independent Set Polytopes
M Göös, R Jain, T Watson
SIAM Journal on Computing 47 (1), 241-269, 2018
292018
Deterministic Communication vs. Partition Number
M Göös, T Pitassi, T Watson
SIAM Journal on Computing 47 (6), 2435-2450, 2018
282018
Time-Space Efficient Simulations of Quantum Computations
D van Melkebeek, T Watson
Theory of Computing 8 (1), 1-51, 2012
232012
Extractors and Lower Bounds for Locally Samplable Sources
A De, T Watson
ACM Transactions on Computation Theory 4 (1), 3:1-3:21, 2012
212012
Query-to-Communication Lifting for P^NP
M Göös, P Kamath, T Pitassi, T Watson
Computational Complexity 28 (1), 113-144, 2019
182019
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
182017
The Complexity of Estimating Min-Entropy
T Watson
Computational Complexity 25 (1), 153-175, 2016
172016
Communication Complexity of Set-Disjointness for All Probabilities
M Göös, T Watson
Proceedings of the 18th International Workshop (Conference) on Randomization …, 2014
172014
Extractors and Lower Bounds for Locally Samplable Sources
A De, T Watson
Proceedings of the 15th International Workshop (Conference) on Randomization …, 2011
152011
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20