Nikhil Mande

Full Name

Dr. N.S. Mande

Email

Nikhil.Mande@cwi.nl

Phone

+31 20 592 4053

Room

L216

Department(s)

Algorithms and Complexity

Function(s)

Researcher

Homepage

https://mande-nikhil.github.io/

Nikhil Mande

Lalonde, O., Mande, N., & de Wolf, R. (2023). Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (pp. 32:1–32:18). doi:10.4230/LIPIcs.FSTTCS.2023.32
Mande, N., & de Wolf, R. (2023). Tight bounds for quantum phase estimation and related problems. In Annual European Symposium on Algorithms (pp. 81:1–81:16). doi:10.4230/LIPIcs.ESA.2023.81
Chattopadhyay, A., Dahiya, Y., Mande, N., Radhakrishnan, J., & Sanyal, S. (2023). Randomized versus deterministic decision tree size. In Proceedings of the annual ACM symposium on Theory of Computing (pp. 867–880). doi:10.1145/3564246.3585199
Chattopadhyay, A., Mande, N., Sanyal, S., & Sherif, S. (2023). Lifting to parity decision trees via Stifling. In Innovations in Theoretical Computer Science Conference (pp. 33:1–33:20). doi:10.4230/LIPIcs.ITCS.2023.33
Cornelissen, A. (Arjan), Mande, N., & Patro, S. (2022). Improved quantum query upper bounds based on classical decision trees. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (pp. 15:1–15:22). doi:10.4230/LIPIcs.FSTTCS.2022.15
Chattopadhyay, A., & Mande, N. (2022). A short list of Equalities induces large sign-rank. SIAM Journal on Computing, 51(3), 820–848. doi:10.1137/19M1271348
Mande, N., Sanyal, S., & Sherif, S. (2022). One-way communication complexity and non-adaptive decision trees. In Proceedings of STACS 2022 (pp. 49:1–49:24). doi:10.4230/LIPIcs.STACS.2022.49
Chakraborty, S., Chattopadhyay, A., Høyer, P., Mande, N., Paraashar, M., & de Wolf, R. (2022). Symmetry and quantum query-to-communication simulation. In Proceedings of International Symposium on Theoretical Aspects of Computer Science (pp. 20:1–20:23). doi:10.4230/LIPIcs.STACS.2022.20
Bun, M., Mande, N., & Thaler, J. (2021). Sign-rank can increase under intersection. ACM Transactions on Computation Theory, 13(4). doi:10.1145/3470863
Chakraborty, S., Mande, N., Mittal, R., Molli, T., Paraashar, M., & Sanyal, S. (2021). Tight Chang’s-lemma-type bounds for Boolean functions. In Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (pp. 10.1–10.22). doi:10.4230/LIPIcs.FSTTCS.2021.10