| No. |
Title |
Author |
Year |
| 1 |
Lifting to Parity Decision Trees via Stifling |
Chattopadhyay, Arkadev et al. |
2023 |
| 2 |
Tight Bounds for Quantum Phase Estimation and Related Problems |
Mande, Nikhil S. et al. |
2023 |
| 3 |
Improved Quantum Query Upper Bounds Based on Classical Decision Trees |
Cornelissen, Arjan et al. |
2022 |
| 4 |
One-Way Communication Complexity and Non-Adaptive Decision Trees |
Mande, Nikhil S. et al. |
2022 |
| 5 |
Symmetry and Quantum Query-To-Communication Simulation |
Chakraborty, Sourav et al. |
2022 |
| 6 |
Tight Chang’s-Lemma-Type Bounds for Boolean Functions |
Chakraborty, Sourav et al. |
2021 |
| 7 |
Improved Approximate Degree Bounds for k-Distinctness |
Mande, Nikhil S. et al. |
2020 |
| 8 |
On Parity Decision Trees for Fourier-Sparse Boolean Functions |
Mande, Nikhil S. et al. |
2020 |
| 9 |
Quantum Query-To-Communication Simulation Needs a Logarithmic Overhead |
Chakraborty, Sourav et al. |
2020 |
| 10 |
Approximate Degree, Secret Sharing, and Concentration Phenomena |
Bogdanov, Andrej et al. |
2019 |
| 11 |
Sign-Rank Can Increase Under Intersection |
Bun, Mark et al. |
2019 |
| 12 |
A Lifting Theorem with Applications to Symmetric Functions |
Chattopadhyay, Arkadev et al. |
2018 |
