Nikhil Mande
Nikhil Mande
Postdoctoral fellow, CWI, Amsterdam
No verified email - Homepage
Title
Cited by
Cited by
Year
The log-approximate-rank conjecture is false
A Chattopadhyay, NS Mande, S Sherif
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computingá…, 2019
182019
A short list of equalities induces large sign rank
A Chattopadhyay, N Mande
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 47-58, 2018
15*2018
Separation of unbounded-error models in multi-party communication complexity
A Chattopadhyay, NS Mande
Theory of Computing 14 (1), 1-23, 2018
5*2018
Quantum Query-to-Communication simulation needs a logarithmic overhead
S Chakraborty, A Chattopadhyay, NS Mande, M Paraashar
arXiv preprint arXiv:1909.10428, 2019
42019
Approximate degree, secret sharing, and concentration phenomena
A Bogdanov, NS Mande, J Thaler, C Williamson
arXiv preprint arXiv:1906.00326, 2019
42019
On parity decision trees for Fourier-sparse Boolean functions
NS Mande, S Sanyal
arXiv preprint arXiv:2008.00266, 2020
32020
Lower bounds for linear decision lists
A Chattopadhyay, M Mahajan, N Mande, N Saurabh
arXiv preprint arXiv:1901.05911, 2019
32019
A lifting theorem with applications to symmetric functions
A Chattopadhyay, NS Mande
37th IARCS Annual Conference on Foundations of Software Technology andá…, 2018
32018
Dual polynomials and communication complexity of XOR functions.
A Chattopadhyay, NS Mande
Electronic Colloquium on Computational Complexity (ECCC) 24, 62, 2017
32017
Improved approximate degree bounds for k-distinctness
NS Mande, J Thaler, S Zhu
arXiv preprint arXiv:2002.08389, 2020
22020
The Log-Approximate-Rank Conjecture Is False
A Chattopadhyay, NS Mande, S Sherif
Journal of the ACM (JACM) 67 (4), 1-28, 2020
12020
One-way communication complexity and non-adaptive decision trees
NS Mande, S Sanyal
arXiv e-prints, arXiv: 2105.01963, 2021
2021
Symmetry and Quantum Query-to-Communication Simulation
S Chakraborty, A Chattopadhyay, P H°yer, NS Mande, M Paraashar, ...
arXiv preprint arXiv:2012.05233, 2020
2020
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
2020
Sign-Rank Can Increase Under Intersection
M Bun, NS Mande, J Thaler
arXiv preprint arXiv:1903.00544, 2019
2019
LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS, LIPICS
S Arunachalam, S Chakraborty, M Paraashar, T Lee, R De Wolf, ...
2019
Communication Complexity of XOR Functions
NS Mande
Tata Institute of Fundamental Research Mumbai, 2018
2018
Dual polynomials and communication complexity of functions
A Chattopadhyay, NS Mande
arXiv preprint arXiv:1704.02537, 2017
2017
The system can't perform the operation now. Try again later.
Articles 1–18