Get started
Author

Nikhil S. Mande

Observed names: Mande, N.S., Mande, N.S. (Nikhil), Mande, Nikhil, Mande, Nikhil S., Nikhil Mande, Nikhil Shekhar Mande
Observed institutions: Tata Institute of Fundamental Research, Centrum Wiskunde & Informatica, University of Liverpool, Georgetown University, QuSoft, Max Planck Institute for Informatics, Université de Montréal
ORCID: 0000-0002-9520-7340
Observed ORCID: 0000-0002-9520-7340
OpenAlex ID: A5027137684
The Log-Approximate-Rank Conjecture Is False
2019 · Arkadev Chattopadhyay, Nikhil S. Mande, et al. · ACM Symposium on Theory of Computing (STOC) · 32
A Short List of Equalities Induces Large Sign Rank
2018 · Arkadev Chattopadhyay, Nikhil Mande · Annual Symposium on Foundations of Computer Science · 8
Tight Bounds for Quantum Phase Estimation and Related Problems
2026 · Nikhil S. Mande, Ronald de Wolf · Quantum · 7
PDF
Improved Approximate Degree Bounds For k-distinctness
2020 · Mande, Nikhil S., Thaler, Justin, et al. · arXiv (Cornell University) · 5
PDF
Lower Bounds for Linear Decision Lists
2019 · Chattopadhyay, Arkadev, Mahajan, Meena, et al. · arXiv (Cornell University) · 5
PDF
Weights at the Bottom Matter When the Top is Heavy
2017 · Chattopadhyay, Arkadev, Mande, Nikhil S. · arXiv (Cornell University) · 5
PDF
Randomized versus Deterministic Decision Tree Size
2023 · Arkadev Chattopadhyay, Yogesh Dahiya, et al. · ACM Symposium on Theory of Computing (STOC) · 4
PDF
Lifting to Parity Decision Trees Via Stifling
2022 · Chattopadhyay, Arkadev, Mande, Nikhil S., et al. · arXiv (Cornell University) · 4
PDF
Approximate Degree, Secret Sharing, and Concentration Phenomena
2019 · Bogdanov, Andrej, Mande, Nikhil S., et al. · arXiv (Cornell University) · 4
PDF
Quantum Query-To-Communication Simulation Needs a Logarithmic Overhead
2019 · Chakraborty, Sourav, Chattopadhyay, Arkadev, et al. · arXiv (Cornell University) · 3
PDF
Untitled
2018 · Arkadev Chattopadhyay, Nikhil S. Mande · Theory of Computing · 3
PDF
Improved Quantum Query Upper Bounds Based on Classical Decision Trees
2022 · Cornelissen, Arjan, Mande, Nikhil S., et al. · arXiv (Cornell University) · 2
PDF
The Role of Symmetry in Quantum Query-to-Communication Simulation
2020 · Chakraborty, Sourav, Chattopadhyay, Arkadev, et al. · arXiv (Cornell University) · 2
PDF
Tight Chang's-lemma-type bounds for Boolean functions
2020 · Chakraborty, Sourav, Mande, Nikhil S., et al. · arXiv (Cornell University) · 2
PDF
On Parity Decision Trees for Fourier-Sparse Boolean Functions
2020 · Mande, Nikhil S., Sanyal, Swagato · arXiv (Cornell University) · 2
PDF
A Lifting Theorem with Applications to Symmetric Functions
2018 · Chattopadhyay, Arkadev, Mande, Nikhil S. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2
PDF
Dual polynomials and communication complexity of XOR functions.
2017 · Arkadev Chattopadhyay, Nikhil S. Mande · arXiv (Cornell University) · 2
Lower bounds for quantum-inspired classical algorithms via communication complexity
2025 · Nikhil S. Mande, Changpeng Shao · Quantum · 1
PDF
A Short List of Equalities Induces Large Sign-Rank
2022 · Arkadev Chattopadhyay, Nikhil S. Mande · SIAM Journal on Computing · 1
PDF
Exact quantum query complexity of computing Hamming weight modulo powers of two and three
2021 · Cornelissen, Arjan, Mande, Nikhil S., et al. · arXiv (Cornell University) · 1
PDF
Sign-rank Can Increase under Intersection
2021 · Mark Bun, Nikhil S. Mande, et al. · ACM Transactions on Computation Theory · 1
PDF
On parity decision trees for Fourier-sparse Boolean functions.
2020 · Nikhil S. Mande, Swagato Sanyal · Electronic colloquium on computational complexity · 1
Small Error Versus Unbounded Error Protocols in the NOF Model.
2016 · Arkadev Chattopadhyay, Nikhil S. Mande · Electronic colloquium on computational complexity · 1
Directed Cut-Query Complexity of Finding a King
2026 · Alaoui, Ziad Ismaili, Lachish, Oded, et al. · arXiv (Cornell University)
PDF
Quantum Query Complexity of Maximum Degree and its Generalizations
2026 · Gilani, Amin Shiraz, Mande, Nikhil S., et al. · arXiv (Cornell University)
PDF
Works count: 49
Citation count: 98
H-index: 5
I10-index: 1
Year
Topic
Type