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