( en | de | ru )

 

Disambiguation of "Watson, Thomas"

Author of the publication

copydeleteadd this publication to your clipboard
When Is Amplification Necessary for Composition in Randomized Query Complexity?

, , , and . APPROX-RANDOM, volume 176 of LIPIcs, page 28:1-28:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Watson Pedlow

Christopher Watson

Michael Watson

Myles Watson

David Watson

 

Other publications of authors with the same name

A Lower Bound for Sampling Disjoint Sets., and . ACM Trans. Comput. Theory, 12 (3): 20:1-20:13 (2020)Rectangles Are Nonnegative Juntas., , , , and . Electron. Colloquium Comput. Complex., (2014)Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity., , and . Electron. Colloquium Comput. Complex., (2019)LYSTO: The Lymphocyte Assessment Hackathon and Benchmark Dataset., , , , , , , , , and 11 other author(s). CoRR, (2023)Abstraction hierarchy in deep learning neural networks., , and . IJCNN, page 768-774. IEEE, (2017)Deterministic Communication vs. Partition Number., , and . FOCS, page 1077-1088. IEEE Computer Society, (2015)A ZPPNP1 Lifting Theorem.. STACS, volume 126 of LIPIcs, page 59:1-59:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Learning to Control DC Motor for Micromobility in Real Time With Reinforcement Learning., , and . ITSC, page 1248-1254. IEEE, (2022)Pseudorandom Generators for Combinatorial Checkerboards.. CCC, page 232-242. IEEE Computer Society, (2011)Query-to-Communication Lifting for P^NP., , , and . CCC, volume 79 of LIPIcs, page 12:1-12:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)