| No. |
Title |
Author |
Year |
| 1 |
Complexity of Fault Tolerant Query Complexity |
Maharjan, Ramita et al. |
2022 |
| 2 |
Erdős-Selfridge Theorem for Nonmonotone CNFs |
Rahman, Md Lutfar et al. |
2022 |
| 3 |
6-Uniform Maker-Breaker Game Is PSPACE-Complete |
Rahman, Md Lutfar et al. |
2021 |
| 4 |
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity |
Pitassi, Toniann et al. |
2020 |
| 5 |
When Is Amplification Necessary for Composition in Randomized Query Complexity? |
Ben-David, Shalev et al. |
2020 |
| 6 |
A Lower Bound for Sampling Disjoint Sets |
Göös, Mika et al. |
2019 |
| 7 |
A ZPP^NP[1] Lifting Theorem |
Watson, Thomas |
2019 |
| 8 |
Amplification with One NP Oracle Query |
Watson, Thomas |
2019 |
| 9 |
Communication Complexity with Small Advantage |
Watson, Thomas |
2018 |
| 10 |
Complexity of Unordered CNF Games |
Rahman, Md Lutfar et al. |
2018 |
| 11 |
Communication Complexity of Statistical Distance |
Watson, Thomas |
2017 |
| 12 |
Query-to-Communication Lifting for P^NP |
Göös, Mika et al. |
2017 |
| 13 |
Randomized Communication vs. Partition Number |
Göös, Mika et al. |
2017 |
| 14 |
The Landscape of Communication Complexity Classes |
Göös, Mika et al. |
2016 |
| 15 |
Communication Complexity of Set-Disjointness for All Probabilities |
Göös, Mika et al. |
2014 |
| 16 |
The Complexity of Deciding Statistical Properties of Samplable Distributions |
Watson, Thomas |
2014 |
| 17 |
Advice Lower Bounds for the Dense Model Theorem |
Watson, Thomas |
2013 |
