Thomas Watson - RankMe

97 papers A* 8A 9B 3Journal 68Unranked 9

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Tractable Unordered 3-CNF Games. Comput. Complex. Md Lutfar Rahman, Thomas Watson
2023	J	`jnl`	6-Uniform Maker-Breaker Game is PSPACE-Complete. Comb. Md Lutfar Rahman, Thomas Watson
2022	J	`jnl`	Amplification with One NP Oracle Query. Comput. Complex. Thomas Watson
2022	—	`conf`	Complexity of Fault Tolerant Query Complexity. FSTTCS Ramita Maharjan, Thomas Watson
2022	—	`conf`	Erdős-Selfridge Theorem for Nonmonotone CNFs. SWAT Md Lutfar Rahman, Thomas Watson
2022	J	`jnl`	Erdős-Selfridge Theorem for Nonmonotone CNFs. CoRR Md Lutfar Rahman, Thomas Watson
2021	A	`conf`	6-Uniform Maker-Breaker Game Is PSPACE-Complete. STACS Md Lutfar Rahman, Thomas Watson
2021	J	`jnl`	Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity. Comput. Complex. Toniann Pitassi, Morgan Shirley, Thomas Watson
2020	J	`jnl`	6-Uniform Maker-Breaker Game Is PSPACE-Complete. Electron. Colloquium Comput. Complex. Md Lutfar Rahman, Thomas Watson
2020	J	`jnl`	A Lower Bound for Sampling Disjoint Sets. ACM Trans. Comput. Theory Mika Göös, Thomas Watson
2020	J	`jnl`	A ZPP ACM Trans. Comput. Theory Thomas Watson
2020	J	`jnl`	Communication Complexity with Small Advantage. Comput. Complex. Thomas Watson
2020	J	`jnl`	Complexity of Unordered CNF Games. ACM Trans. Comput. Theory Md Lutfar Rahman, Thomas Watson
2020	J	`jnl`	Correction to: Communication complexity with small advantage. Comput. Complex. Thomas Watson
2020	A*	`conf`	Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity. ICALP Toniann Pitassi, Morgan Shirley, Thomas Watson
2020	J	`jnl`	Quadratic Simulations of Merlin-Arthur Games. ACM Trans. Comput. Theory Thomas Watson
2020	J	`jnl`	Query-to-Communication Lifting for BPP. SIAM J. Comput. Mika Göös, Toniann Pitassi, Thomas Watson
2020	B	`conf`	Tractable Unordered 3-CNF Games. LATIN Md Lutfar Rahman, Thomas Watson
2020	—	`conf`	When Is Amplification Necessary for Composition in Randomized Query Complexity? APPROX-RANDOM Shalev Ben-David, Mika Göös, Robin Kothari, Thomas Watson
2020	J	`jnl`	When Is Amplification Necessary for Composition in Randomized Query Complexity? CoRR Shalev Ben-David, Mika Göös, Robin Kothari, Thomas Watson
2019	—	`conf`	A Lower Bound for Sampling Disjoint Sets. APPROX-RANDOM Mika Göös, Thomas Watson
2019	J	`jnl`	A Lower Bound for Sampling Disjoint Sets. Electron. Colloquium Comput. Complex. Thomas Watson
2019	A	`conf`	A ZPP STACS Thomas Watson
2019	A*	`conf`	Amplification with One NP Oracle Query. ICALP Thomas Watson
2019	J	`jnl`	Correction to: Query-to-Communication Lifting for P NP. Comput. Complex. Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson
2019	J	`jnl`	Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity. Electron. Colloquium Comput. Complex. Toniann Pitassi, Morgan Shirley, Thomas Watson
2019	J	`jnl`	Query-to-Communication Lifting for P NP. Comput. Complex. Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson
2019	J	`jnl`	Tractable Unordered 3-CNF Games. Electron. Colloquium Comput. Complex. Md Lutfar Rahman, Thomas Watson
2018	J	`jnl`	Amplification with One NP Oracle Query. Electron. Colloquium Comput. Complex. Thomas Watson
2018	J	`jnl`	Communication Complexity of Statistical Distance. ACM Trans. Comput. Theory Thomas Watson
2018	A	`conf`	Communication Complexity with Small Advantage. CCC Thomas Watson
2018	B	`conf`	Complexity of Unordered CNF Games. ISAAC Md Lutfar Rahman, Thomas Watson
2018	J	`jnl`	Complexity of Unordered CNF Games. Electron. Colloquium Comput. Complex. Md Lutfar Rahman, Thomas Watson
2018	J	`jnl`	Deterministic Communication vs. Partition Number. SIAM J. Comput. Mika Göös, Toniann Pitassi, Thomas Watson
2018	J	`jnl`	Extension Complexity of Independent Set Polytopes. SIAM J. Comput. Mika Göös, Rahul Jain, Thomas Watson
2018	B	`conf`	Quadratic Simulations of Merlin-Arthur Games. LATIN Thomas Watson
2018	J	`jnl`	Randomized Communication versus Partition Number. ACM Trans. Comput. Theory Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson
2018	J	`jnl`	The Landscape of Communication Complexity Classes. Comput. Complex. Mika Göös, Toniann Pitassi, Thomas Watson
2017	J	`jnl`	A ZPP^NP[1] Lifting Theorem. Electron. Colloquium Comput. Complex. Thomas Watson
2017	—	`conf`	Communication Complexity of Statistical Distance. APPROX-RANDOM Thomas Watson
2017	J	`jnl`	Quadratic Simulations of Merlin-Arthur Games. Electron. Colloquium Comput. Complex. Thomas Watson
2017	A*	`conf`	Query-to-Communication Lifting for BPP. FOCS Mika Göös, Toniann Pitassi, Thomas Watson
2017	J	`jnl`	Query-to-Communication Lifting for BPP. CoRR Mika Göös, Toniann Pitassi, Thomas Watson
2017	J	`jnl`	Query-to-Communication Lifting for BPP. Electron. Colloquium Comput. Complex. Mika Göös, Toniann Pitassi, Thomas Watson
2017	A	`conf`	Query-to-Communication Lifting for P^NP. CCC Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson
2017	J	`jnl`	Query-to-Communication Lifting for P^NP. Electron. Colloquium Comput. Complex. Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson
2017	A*	`conf`	Randomized Communication vs. Partition Number. ICALP Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson
2016	J	`jnl`	Communication Complexity of Set-Disjointness for All Probabilities. Theory Comput. Mika Göös, Thomas Watson
2016	J	`jnl`	Communication Complexity of Statistical Distance. Electron. Colloquium Comput. Complex. Thomas Watson
2016	J	`jnl`	Communication Complexity with Small Advantage. Electron. Colloquium Comput. Complex. Thomas Watson
2016	A*	`conf`	Extension Complexity of Independent Set Polytopes. FOCS Mika Göös, Rahul Jain, Thomas Watson
2016	J	`jnl`	Extension Complexity of Independent Set Polytopes. CoRR Mika Göös, Rahul Jain, Thomas Watson
2016	J	`jnl`	Extension Complexity of Independent Set Polytopes. Electron. Colloquium Comput. Complex. Mika Göös, Rahul Jain, Thomas Watson
2016	J	`jnl`	Nonnegative Rank vs. Binary Rank. Chic. J. Theor. Comput. Sci. Thomas Watson
2016	J	`jnl`	Nonnegative Rank vs. Binary Rank. CoRR Thomas Watson
2016	J	`jnl`	Rectangles Are Nonnegative Juntas. SIAM J. Comput. Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman
2016	A*	`conf`	The Landscape of Communication Complexity Classes. ICALP Mika Göös, Toniann Pitassi, Thomas Watson
2016	J	`jnl`	The complexity of estimating min-entropy. Comput. Complex. Thomas Watson
2016	J	`jnl`	Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. Algorithmica Mika Göös, Toniann Pitassi, Thomas Watson
2015	A*	`conf`	Deterministic Communication vs. Partition Number. FOCS Mika Göös, Toniann Pitassi, Thomas Watson
2015	J	`jnl`	Deterministic Communication vs. Partition Number. Electron. Colloquium Comput. Complex. Mika Göös, Toniann Pitassi, Thomas Watson
2015	J	`jnl`	Query Complexity in Errorless Hardness Amplification. Comput. Complex. Thomas Watson
2015	J	`jnl`	Randomized Communication vs. Partition Number. Electron. Colloquium Comput. Complex. Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson
2015	A*	`conf`	Rectangles Are Nonnegative Juntas. STOC Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman
2015	J	`jnl`	The Complexity of Deciding Statistical Properties of Samplable Distributions. Theory Comput. Thomas Watson
2015	J	`jnl`	The Landscape of Communication Complexity Classes. Electron. Colloquium Comput. Complex. Mika Göös, Toniann Pitassi, Thomas Watson
2015	A	`conf`	Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. ITCS Mika Göös, Toniann Pitassi, Thomas Watson
2014	J	`jnl`	Advice Lower Bounds for the Dense Model Theorem. ACM Trans. Comput. Theory Thomas Watson
2014	—	`conf`	Communication Complexity of Set-Disjointness for All Probabilities. APPROX-RANDOM Mika Göös, Thomas Watson
2014	J	`jnl`	Communication Complexity of Set-Disjointness for All Probabilities. Electron. Colloquium Comput. Complex. Mika Göös, Thomas Watson
2014	J	`jnl`	Lift-and-Project Integrality Gaps for the Traveling Salesperson Problem. Chic. J. Theor. Comput. Sci. Thomas Watson
2014	J	`jnl`	Rectangles Are Nonnegative Juntas. Electron. Colloquium Comput. Complex. Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman
2014	A	`conf`	The Complexity of Deciding Statistical Properties of Samplable Distributions. STACS Thomas Watson
2014	J	`jnl`	Time Hierarchies for Sampling Distributions. SIAM J. Comput. Thomas Watson
2014	J	`jnl`	Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. Electron. Colloquium Comput. Complex. Mika Göös, Toniann Pitassi, Thomas Watson
2013	A	`conf`	Advice Lower Bounds for the Dense Model Theorem. STACS Thomas Watson
2013	J	`jnl`	Pseudorandom generators for combinatorial checkerboards. Comput. Complex. Thomas Watson
2013	J	`jnl`	The Complexity of Deciding Statistical Properties of Samplable Distributions. Electron. Colloquium Comput. Complex. Thomas Watson
2013	A	`conf`	Time hierarchies for sampling distributions. ITCS Thomas Watson
2012	J	`jnl`	Extractors and Lower Bounds for Locally Samplable Sources. ACM Trans. Comput. Theory Anindya De, Thomas Watson
2012	J	`jnl`	Relativized Worlds without Worst-Case to Average-Case Reductions for NP. ACM Trans. Comput. Theory Thomas Watson
2012	J	`jnl`	The Complexity of Estimating Min-Entropy. Electron. Colloquium Comput. Complex. Thomas Watson
2012	J	`jnl`	Time Hierarchies for Sampling Distributions. Electron. Colloquium Comput. Complex. Thomas Watson
2012	J	`jnl`	Time-Space Efficient Simulations of Quantum Computations. Theory Comput. Dieter van Melkebeek, Thomas Watson
2011	J	`jnl`	Advice Lower Bounds for the Dense Model Theorem. Electron. Colloquium Comput. Complex. Thomas Watson
2011	—	`conf`	Extractors and Lower Bounds for Locally Samplable Sources. APPROX-RANDOM Anindya De, Thomas Watson
2011	J	`jnl`	Extractors and Lower Bounds for Locally Samplable Sources. Electron. Colloquium Comput. Complex. Anindya De, Thomas Watson
2011	J	`jnl`	Lift-and-Project Integrality Gaps for the Traveling Salesperson Problem CoRR Thomas Watson
2011	J	`jnl`	Lift-and-Project Integrality Gaps for the Traveling Salesperson Problem. Electron. Colloquium Comput. Complex. Thomas Watson
2011	A	`conf`	Pseudorandom Generators for Combinatorial Checkerboards. CCC Thomas Watson
2011	—	`conf`	Query Complexity in Errorless Hardness Amplification. APPROX-RANDOM Thomas Watson
2010	J	`jnl`	Pseudorandom Generators for Combinatorial Checkerboards. Electron. Colloquium Comput. Complex. Thomas Watson
2010	J	`jnl`	Query Complexity in Errorless Hardness Amplification. Electron. Colloquium Comput. Complex. Thomas Watson
2010	J	`jnl`	Relativized Worlds Without Worst-Case to Average-Case Reductions for NP. Electron. Colloquium Comput. Complex. Thomas Watson
2010	—	`conf`	Relativized Worlds without Worst-Case to Average-Case Reductions for NP. APPROX-RANDOM Thomas Watson
2010	J	`jnl`	Time-Space Efficient Simulations of Quantum Computations. Electron. Colloquium Comput. Complex. Dieter van Melkebeek, Thomas Watson
2008	J	`jnl`	A Quantum Time-Space Lower Bound for the Counting Hierarchy. Electron. Colloquium Comput. Complex. Dieter van Melkebeek, Thomas Watson