| 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 | 11 | 2019 |
| 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 | 11* | 2018 |
| Separation of unbounded-error models in multi-party communication complexity A Chattopadhyay, NS Mande Theory of Computing 14 (1), 1-23, 2018 | 4* | 2018 |
| Dual polynomials and communication complexity of XOR functions. A Chattopadhyay, NS Mande Electronic Colloquium on Computational Complexity (ECCC) 24, 62, 2017 | 2 | 2017 |
| Approximate degree, secret sharing, and concentration phenomena A Bogdanov, NS Mande, J Thaler, C Williamson arXiv preprint arXiv:1906.00326, 2019 | 1 | 2019 |
| Lower bounds for linear decision lists A Chattopadhyay, M Mahajan, N Mande, N Saurabh arXiv preprint arXiv:1901.05911, 2019 | 1 | 2019 |
| A lifting theorem with applications to symmetric functions A Chattopadhyay, NS Mande 37th IARCS Annual Conference on Foundations of Software Technology and …, 2018 | 1 | 2018 |
| Improved Approximate Degree Bounds For k-distinctness NS Mande, J Thaler, S Zhu arXiv preprint arXiv:2002.08389, 2020 | | 2020 |
| Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead S Chakraborty, A Chattopadhyay, NS Mande, M Paraashar arXiv preprint arXiv:1909.10428, 2019 | | 2019 |
| Sign-Rank Can Increase Under Intersection M Bun, NS Mande, J Thaler arXiv preprint arXiv:1903.00544, 2019 | | 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 |
Arkadev ChattopadhyayReader at Tata Institute of Fundamental ResearchVerified email at tifr.res.in
