Nikhil S. Mande

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 56

Top Topics

Query Complexity

Boolean Functions

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Nikhil S. Mande, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh
On the communication complexity of finding a king in a tournament. CoRR (2024)
Nikhil S. Mande, Changpeng Shao
Lower bounds for quantum-inspired classical algorithms via communication complexity. CoRR (2024)
Alison Hsiang-Hsuan Liu, Nikhil S. Mande
Instance complexity of Boolean functions. CoRR (2023)
Arkadev Chattopadhyay, Yogesh Dahiya, Nikhil S. Mande, Jaikumar Radhakrishnan, Swagato Sanyal
Randomized versus Deterministic Decision Tree Size. STOC (2023)
Nikhil S. Mande, Manaswi Paraashar, Nitin Saurabh
Randomized and Quantum Query Complexities of Finding a King in a Tournament. FSTTCS (2023)
Nikhil S. Mande, Ronald de Wolf
Tight Bounds for Quantum Phase Estimation and Related Problems. ESA (2023)
Nikhil S. Mande, Ronald de Wolf
Tight Bounds for Quantum Phase Estimation and Related Problems. CoRR (2023)
Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal, Suhail Sherif
Lifting to Parity Decision Trees via Stifling. ITCS (2023)
Nikhil S. Mande, Manaswi Paraashar, Nitin Saurabh
Randomized and quantum query complexities of finding a king in a tournament. CoRR (2023)
Olivier Lalonde, Nikhil S. Mande, Ronald de Wolf
Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error. FSTTCS (2023)
Arkadev Chattopadhyay, Nikhil S. Mande
A Short List of Equalities Induces Large Sign-Rank. SIAM J. Comput. 51 (3) (2022)
Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf
Symmetry and Quantum Query-To-Communication Simulation. STACS (2022)
Arjan Cornelissen, Nikhil S. Mande, Subhasree Patro
Improved Quantum Query Upper Bounds Based on Classical Decision Trees. CoRR (2022)
Arjan Cornelissen, Nikhil S. Mande, Subhasree Patro
Improved Quantum Query Upper Bounds Based on Classical Decision Trees. FSTTCS (2022)
Nikhil S. Mande, Swagato Sanyal, Suhail Sherif
One-Way Communication Complexity and Non-Adaptive Decision Trees. STACS (2022)
Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal, Suhail Sherif
Lifting to Parity Decision Trees Via Stifling. CoRR (2022)
Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal, Suhail Sherif
Lifting to Parity Decision Trees Via Stifling. Electron. Colloquium Comput. Complex. (2022)
Arkadev Chattopadhyay, Yogesh Dahiya, Nikhil S. Mande, Jaikumar Radhakrishnan, Swagato Sanyal
Randomized versus Deterministic Decision Tree Size. Electron. Colloquium Comput. Complex. (2022)
Arjan Cornelissen, Nikhil S. Mande, Maris Ozols, Ronald de Wolf
Exact quantum query complexity of computing Hamming weight modulo powers of two and three. CoRR (2021)
Nikhil S. Mande, Ronald de Wolf
Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error. Electron. Colloquium Comput. Complex. 28 (2021)
Sourav Chakraborty, Nikhil S. Mande, Rajat Mittal, Tulasimohan Molli, Manaswi Paraashar, Swagato Sanyal
Tight Chang's-Lemma-Type Bounds for Boolean Functions. FSTTCS (2021)
Mark Bun, Nikhil S. Mande, Justin Thaler
Sign-rank Can Increase under Intersection. ACM Trans. Comput. Theory 13 (4) (2021)
Nikhil S. Mande, Ronald de Wolf
Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error. CoRR (2021)
Nikhil S. Mande, Swagato Sanyal
One-way communication complexity and non-adaptive decision trees. CoRR (2021)
Nikhil S. Mande, Swagato Sanyal
One-way communication complexity and non-adaptive decision trees. Electron. Colloquium Comput. Complex. 28 (2021)
Nikhil S. Mande, Justin Thaler, Shuchen Zhu
Improved Approximate Degree Bounds for k-Distinctness. TQC (2020)
Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf
Symmetry and Quantum Query-to-Communication Simulation. CoRR (2020)
Arkadev Chattopadhyay, Meena Mahajan, Nikhil S. Mande, Nitin Saurabh
Lower bounds for linear decision lists. Chic. J. Theor. Comput. Sci. 2020 (2020)
Nikhil S. Mande, Swagato Sanyal
On Parity Decision Trees for Fourier-Sparse Boolean Functions. FSTTCS (2020)
Nikhil S. Mande, Justin Thaler, Shuchen Zhu
Improved Approximate Degree Bounds For k-distinctness. CoRR (2020)
Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar
Quantum Query-To-Communication Simulation Needs a Logarithmic Overhead. Computational Complexity Conference (2020)
Nikhil S. Mande, Swagato Sanyal
On parity decision trees for Fourier-sparse Boolean functions. Electron. Colloquium Comput. Complex. 27 (2020)
Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif
The Log-Approximate-Rank Conjecture Is False. J. ACM 67 (4) (2020)
Nikhil S. Mande, Swagato Sanyal
On parity decision trees for Fourier-sparse Boolean functions. CoRR (2020)
Nikhil S. Mande, Justin Thaler, Shuchen Zhu
Improved Approximate Degree Bounds For $k$-distinctness. Electron. Colloquium Comput. Complex. 27 (2020)
Sourav Chakraborty, Nikhil S. Mande, Rajat Mittal, Tulasimohan Molli, Manaswi Paraashar, Swagato Sanyal
Tight Chang's-lemma-type bounds for Boolean functions. CoRR (2020)
Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif
The log-approximate-rank conjecture is false. STOC (2019)
Mark Bun, Nikhil S. Mande, Justin Thaler
Sign-Rank Can Increase Under Intersection. CoRR (2019)
Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar
Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead. Electron. Colloquium Comput. Complex. 26 (2019)
Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar
Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead. CoRR (2019)
Arkadev Chattopadhyay, Meena Mahajan, Nikhil S. Mande, Nitin Saurabh
Lower Bounds for Linear Decision Lists. CoRR (2019)
Andrej Bogdanov, Nikhil S. Mande, Justin Thaler, Christopher Williamson
Approximate degree, secret sharing, and concentration phenomena. Electron. Colloquium Comput. Complex. 26 (2019)
Mark Bun, Nikhil S. Mande, Justin Thaler
Sign-Rank Can Increase Under Intersection. Electron. Colloquium Comput. Complex. 26 (2019)
Arkadev Chattopadhyay, Meena Mahajan, Nikhil S. Mande, Nitin Saurabh
Lower Bounds for Linear Decision Lists. Electron. Colloquium Comput. Complex. 26 (2019)
Andrej Bogdanov, Nikhil S. Mande, Justin Thaler, Christopher Williamson
Approximate Degree, Secret Sharing, and Concentration Phenomena. APPROX-RANDOM (2019)
Andrej Bogdanov, Nikhil S. Mande, Justin Thaler, Christopher Williamson
Approximate degree, secret sharing, and concentration phenomena. CoRR (2019)
Mark Bun, Nikhil S. Mande, Justin Thaler
Sign-Rank Can Increase Under Intersection. ICALP (2019)
Arkadev Chattopadhyay, Nikhil S. Mande
Separation of Unbounded-Error Models in Multi-Party Communication Complexity. Theory Comput. 14 (1) (2018)
Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif
The Log-Approximate-Rank Conjecture is False. Electron. Colloquium Comput. Complex. 25 (2018)
Arkadev Chattopadhyay, Nikhil S. Mande
A Short List of Equalities Induces Large Sign Rank. FOCS (2018)
Arkadev Chattopadhyay, Nikhil S. Mande
Weights at the Bottom Matter When the Top is Heavy. CoRR (2017)
Arkadev Chattopadhyay, Nikhil S. Mande
Dual polynomials and communication complexity of XOR functions. CoRR (2017)
Arkadev Chattopadhyay, Nikhil S. Mande
A Lifting Theorem with Applications to Symmetric Functions. FSTTCS (2017)
Arkadev Chattopadhyay, Nikhil S. Mande
Dual polynomials and communication complexity of XOR functions. Electron. Colloquium Comput. Complex. 24 (2017)
Arkadev Chattopadhyay, Nikhil S. Mande
Weights at the Bottom Matter When the Top is Heavy. Electron. Colloquium Comput. Complex. 24 (2017)
Arkadev Chattopadhyay, Nikhil S. Mande
Small Error Versus Unbounded Error Protocols in the NOF Model. Electron. Colloquium Comput. Complex. 23 (2016)