Small Error Versus Unbounded Error Protocols in the NOF Model. - Arkadev Chattopadhyay; Nikhil S. Mande (Electron. Colloquium Comput. Complex., 2016)

A Lifting Theorem with Applications to Symmetric Functions. - Arkadev Chattopadhyay; Nikhil S. Mande (FSTTCS, 2017)

Dual polynomials and communication complexity of XOR functions. - Arkadev Chattopadhyay; Nikhil S. Mande (Electron. Colloquium Comput. Complex., 2017)

Weights at the Bottom Matter When the Top is Heavy. - Arkadev Chattopadhyay; Nikhil S. Mande (Electron. Colloquium Comput. Complex., 2017)

The Log-Approximate-Rank Conjecture is False. - Arkadev Chattopadhyay; Nikhil S. Mande; Suhail Sherif (Electron. Colloquium Comput. Complex., 2018)

Separation of Unbounded-Error Models in Multi-Party Communication Complexity. - Arkadev Chattopadhyay; Nikhil S. Mande (Theory Comput., 2018)

Approximate degree, secret sharing, and concentration phenomena. - Andrej Bogdanov; Nikhil S. Mande; Justin Thaler; Christopher Williamson (Electron. Colloquium Comput. Complex., 2019)

Sign-Rank Can Increase Under Intersection. - Mark Bun; Nikhil S. Mande; Justin Thaler (Electron. Colloquium Comput. Complex., 2019)

Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead. - Sourav Chakraborty 001; Arkadev Chattopadhyay; Nikhil S. Mande; Manaswi Paraashar (Electron. Colloquium Comput. Complex., 2019)

Lower bounds for linear decision lists. - Arkadev Chattopadhyay; Meena Mahajan; Nikhil S. Mande; Nitin Saurabh (Chic. J. Theor. Comput. Sci., 2020)

On parity decision trees for Fourier-sparse Boolean functions. - Nikhil S. Mande; Swagato Sanyal (Electron. Colloquium Comput. Complex., 2020)

Improved Approximate Degree Bounds For $k$-distinctness. - Nikhil S. Mande; Justin Thaler; Shuchen Zhu (Electron. Colloquium Comput. Complex., 2020)

Tight Chang's-Lemma-Type Bounds for Boolean Functions. - Sourav Chakraborty 001; Nikhil S. Mande; Rajat Mittal 001; Tulasimohan Molli; Manaswi Paraashar; Swagato Sanyal (FSTTCS, 2021)

Exact quantum query complexity of computing Hamming weight modulo powers of two and three. - Arjan Cornelissen; Nikhil S. Mande; Maris Ozols; Ronald de Wolf (CoRR, 2021)

One-way communication complexity and non-adaptive decision trees. - Nikhil S. Mande; Swagato Sanyal (Electron. Colloquium Comput. Complex., 2021)

Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error. - Nikhil S. Mande; Ronald de Wolf (Electron. Colloquium Comput. Complex., 2021)

Symmetry and Quantum Query-To-Communication Simulation. - Sourav Chakraborty 001; Arkadev Chattopadhyay; Peter Høyer; Nikhil S. Mande; Manaswi Paraashar; Ronald de Wolf (STACS, 2022)

One-Way Communication Complexity and Non-Adaptive Decision Trees. - Nikhil S. Mande; Swagato Sanyal; Suhail Sherif (STACS, 2022)

Randomized versus Deterministic Decision Tree Size. - Arkadev Chattopadhyay; Yogesh Dahiya; Nikhil S. Mande; Jaikumar Radhakrishnan; Swagato Sanyal (Electron. Colloquium Comput. Complex., 2022)

Lifting to Parity Decision Trees Via Stifling. - Arkadev Chattopadhyay; Nikhil S. Mande; Swagato Sanyal; Suhail Sherif (Electron. Colloquium Comput. Complex., 2022)

A Short List of Equalities Induces Large Sign-Rank. - Arkadev Chattopadhyay; Nikhil S. Mande (SIAM J. Comput., 2022)

Tight Bounds for Quantum Phase Estimation and Related Problems. - Nikhil S. Mande; Ronald de Wolf (ESA, 2023)

Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error. - Olivier Lalonde; Nikhil S. Mande; Ronald de Wolf (FSTTCS, 2023)

Randomized and Quantum Query Complexities of Finding a King in a Tournament. - Nikhil S. Mande; Manaswi Paraashar; Nitin Saurabh (FSTTCS, 2023)

Instance complexity of Boolean functions. - Alison Hsiang-Hsuan Liu; Nikhil S. Mande (CoRR, 2023)

On the Communication Complexity of Finding a King in a Tournament. - Nikhil S. Mande; Manaswi Paraashar; Swagato Sanyal; Nitin Saurabh (APPROX/RANDOM, 2024)

Quantum Sabotage Complexity. - Arjan Cornelissen; Nikhil S. Mande; Subhasree Patro (FSTTCS, 2024)

Query Complexity with Unknowns. - Nikhil S. Mande; Karteek Sreenivasaiah (CoRR, 2024)

Sensitivity and Query Complexity Under Uncertainty. - Deepu Benson; Balagopal Komarath; Nikhil S. Mande; Nalli Sai Soumya; Jayalal Sarma; Karteek Sreenivasaiah (MFCS, 2025)

Improved Quantum Query Upper Bounds Based on Classical Decision Trees. - Arjan Cornelissen; Nikhil S. Mande; Subhasree Patro (Quantum, 2025)

Lower bounds for quantum-inspired classical algorithms via communication complexity. - Nikhil S. Mande; Changpeng Shao (Quantum, 2025)

Hardness of Finding Kings and Strong Kings. - Ziad Ismaili Alaoui; Nikhil S. Mande (CoRR, 2025)

Complexity of learning matchings and half graphs via edge queries. - Nikhil S. Mande; Swagato Sanyal; Viktor Zamaraev (CoRR, 2025)