Follow
Nikhil Mande
Nikhil Mande
Lecturer, University of Liverpool
Verified email at liverpool.ac.uk - Homepage
Title
Cited by
Cited by
Year
The log-approximate-rank conjecture is false
A Chattopadhyay, NS Mande, S Sherif
Journal of the ACM (JACM) 67 (4), 1-28, 2020
332020
A Short List of Equalities Induces Large Sign-Rank
A Chattopadhyay, NS Mande
SIAM Journal on Computing 51 (3), 820-848, 2022
23*2022
Improved approximate degree bounds for k-distinctness
NS Mande, J Thaler, S Zhu
arXiv preprint arXiv:2002.08389, 2020
102020
Lower bounds for linear decision lists
A Chattopadhyay, M Mahajan, N Mande, N Saurabh
arXiv preprint arXiv:1901.05911, 2019
72019
Separation of unbounded-error models in multi-party communication complexity
A Chattopadhyay, NS Mande
Theory of Computing 14 (1), 1-23, 2018
7*2018
Approximate degree, secret sharing, and concentration phenomena
A Bogdanov, NS Mande, J Thaler, C Williamson
arXiv preprint arXiv:1906.00326, 2019
62019
On parity decision trees for fourier-sparse boolean functions
NS Mande, S Sanyal
arXiv preprint arXiv:2008.00266, 2020
52020
Quantum query-to-communication simulation needs a logarithmic overhead
S Chakraborty, A Chattopadhyay, NS Mande, M Paraashar
arXiv preprint arXiv:1909.10428, 2019
52019
Dual polynomials and communication complexity of functions
A Chattopadhyay, NS Mande
arXiv preprint arXiv:1704.02537, 2017
52017
A lifting theorem with applications to symmetric functions
A Chattopadhyay, NS Mande
37th IARCS Annual Conference on Foundations of Software Technology and …, 2018
42018
Exact quantum query complexity of computing Hamming weight modulo powers of two and three
A Cornelissen, NS Mande, M Ozols, R de Wolf
arXiv preprint arXiv:2112.14682, 2021
32021
Sign-rank can increase under intersection
M Bun, NS Mande, J Thaler
ACM Transactions on Computation Theory (TOCT) 13 (4), 1-17, 2021
32021
Symmetry and quantum query-to-communication simulation
S Chakraborty, A Chattopadhyay, P Høyer, NS Mande, M Paraashar, ...
arXiv preprint arXiv:2012.05233, 2020
32020
Tight Chang's-lemma-type bounds for Boolean functions
S Chakraborty, NS Mande, R Mittal, T Molli, M Paraashar, S Sanyal
arXiv preprint arXiv:2012.02335, 2020
32020
Improved Quantum Query Upper Bounds Based on Classical Decision Trees
A Cornelissen, NS Mande, S Patro
arXiv preprint arXiv:2203.02968, 2022
22022
Communication Complexity of XOR Functions
NS Mande
Tata Institute of Fundamental Research Mumbai, 2018
12018
Randomized versus Deterministic Decision Tree Size
A Chattopadhyay, Y Dahiya, NS Mande, J Radhakrishnan, S Sanyal
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 867-880, 2023
2023
Tight Bounds for Quantum Phase Estimation and Related Problems
NS Mande, R de Wolf
arXiv preprint arXiv:2305.04908, 2023
2023
Randomized versus Deterministic Decision Tree Size
N Mande, A Chattopadhyay, Y Dahiya, J Radhakrishnan, S Sanyal
2023
Lifting to Parity Decision Trees Via Stifling
A Chattopadhyay, NS Mande, S Sanyal, S Sherif
arXiv preprint arXiv:2211.17214, 2022
2022
The system can't perform the operation now. Try again later.
Articles 1–20