| No. |
Title |
Author |
Year |
| 1 |
Lifting to Parity Decision Trees via Stifling |
Chattopadhyay, Arkadev et al. |
2023 |
| 2 |
On the Composition of Randomized Query Complexity and Approximate Degree |
Chakraborty, Sourav et al. |
2023 |
| 3 |
One-Way Communication Complexity and Non-Adaptive Decision Trees |
Mande, Nikhil S. et al. |
2022 |
| 4 |
Tight Chang’s-Lemma-Type Bounds for Boolean Functions |
Chakraborty, Sourav et al. |
2021 |
| 5 |
On Parity Decision Trees for Fourier-Sparse Boolean Functions |
Mande, Nikhil S. et al. |
2020 |
| 6 |
A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity |
Gavinsky, Dmitry et al. |
2019 |
| 7 |
A Composition Theorem for Randomized Query Complexity |
Anshu, Anurag et al. |
2018 |
| 8 |
Linear Sketching over F_2 |
Kannan, Sampath et al. |
2018 |
| 9 |
The Zero-Error Randomized Query Complexity of the Pointer Function |
Radhakrishnan, Jaikumar et al. |
2016 |
| 10 |
Towards Better Separation between Deterministic and Randomized Query Complexity |
Mukhopadhyay, Sagnik et al. |
2015 |
