default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikhil S. Mande
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Nikhil S. Mande
, Swagato Sanyal:
On parity decision trees for Fourier-sparse Boolean functions. ACM Trans. Comput. Theory 16(2): 9:1-9:26 (2024)- [c18]Nikhil S. Mande, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh:
On the Communication Complexity of Finding a King in a Tournament. APPROX/RANDOM 2024: 64:1-64:23 - [i35]Nikhil S. Mande, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh:
On the communication complexity of finding a king in a tournament. CoRR abs/2402.14751 (2024) - [i34]Nikhil S. Mande, Changpeng Shao:
Lower bounds for quantum-inspired classical algorithms via communication complexity. CoRR abs/2402.15686 (2024) - [i33]Arjan Cornelissen, Nikhil S. Mande, Subhasree Patro:
Quantum Sabotage Complexity. CoRR abs/2408.12595 (2024) - 2023
- [c17]Nikhil S. Mande, Ronald de Wolf:
Tight Bounds for Quantum Phase Estimation and Related Problems. ESA 2023: 81:1-81:16 - [c16]Nikhil S. Mande, Manaswi Paraashar, Nitin Saurabh:
Randomized and Quantum Query Complexities of Finding a King in a Tournament. FSTTCS 2023: 30:1-30:19 - [c15]Olivier Lalonde, Nikhil S. Mande, Ronald de Wolf:
Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error. FSTTCS 2023: 32:1-32:18 - [c14]Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal, Suhail Sherif:
Lifting to Parity Decision Trees via Stifling. ITCS 2023: 33:1-33:20 - [c13]Arkadev Chattopadhyay, Yogesh Dahiya, Nikhil S. Mande, Jaikumar Radhakrishnan, Swagato Sanyal:
Randomized versus Deterministic Decision Tree Size. STOC 2023: 867-880 - [i32]Nikhil S. Mande, Ronald de Wolf:
Tight Bounds for Quantum Phase Estimation and Related Problems. CoRR abs/2305.04908 (2023) - [i31]Nikhil S. Mande, Manaswi Paraashar, Nitin Saurabh:
Randomized and quantum query complexities of finding a king in a tournament. CoRR abs/2308.02472 (2023) - [i30]Alison Hsiang-Hsuan Liu, Nikhil S. Mande:
Instance complexity of Boolean functions. CoRR abs/2309.15026 (2023) - 2022
- [j5]Arkadev Chattopadhyay, Nikhil S. Mande:
A Short List of Equalities Induces Large Sign-Rank. SIAM J. Comput. 51(3): 820-848 (2022) - [c12]Arjan Cornelissen, Nikhil S. Mande, Subhasree Patro:
Improved Quantum Query Upper Bounds Based on Classical Decision Trees. FSTTCS 2022: 15:1-15:22 - [c11]Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf:
Symmetry and Quantum Query-To-Communication Simulation. STACS 2022: 20:1-20:23 - [c10]Nikhil S. Mande, Swagato Sanyal, Suhail Sherif:
One-Way Communication Complexity and Non-Adaptive Decision Trees. STACS 2022: 49:1-49:24 - [i29]Arjan Cornelissen, Nikhil S. Mande, Subhasree Patro:
Improved Quantum Query Upper Bounds Based on Classical Decision Trees. CoRR abs/2203.02968 (2022) - [i28]Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal, Suhail Sherif:
Lifting to Parity Decision Trees Via Stifling. CoRR abs/2211.17214 (2022) - [i27]Arkadev Chattopadhyay, Yogesh Dahiya, Nikhil S. Mande, Jaikumar Radhakrishnan, Swagato Sanyal:
Randomized versus Deterministic Decision Tree Size. Electron. Colloquium Comput. Complex. TR22 (2022) - [i26]Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal, Suhail Sherif:
Lifting to Parity Decision Trees Via Stifling. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j4]Mark Bun, Nikhil S. Mande, Justin Thaler:
Sign-rank Can Increase under Intersection. ACM Trans. Comput. Theory 13(4): 24:1-24:17 (2021) - [c9]Sourav Chakraborty, Nikhil S. Mande, Rajat Mittal, Tulasimohan Molli, Manaswi Paraashar, Swagato Sanyal:
Tight Chang's-Lemma-Type Bounds for Boolean Functions. FSTTCS 2021: 10:1-10:22 - [i25]Nikhil S. Mande, Swagato Sanyal:
One-way communication complexity and non-adaptive decision trees. CoRR abs/2105.01963 (2021) - [i24]Nikhil S. Mande, Ronald de Wolf:
Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error. CoRR abs/2107.11806 (2021) - [i23]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 abs/2112.14682 (2021) - [i22]Nikhil S. Mande, Swagato Sanyal:
One-way communication complexity and non-adaptive decision trees. Electron. Colloquium Comput. Complex. TR21 (2021) - [i21]Nikhil S. Mande, Ronald de Wolf:
Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j3]Arkadev Chattopadhyay, Meena Mahajan, Nikhil S. Mande, Nitin Saurabh:
Lower bounds for linear decision lists. Chic. J. Theor. Comput. Sci. 2020 (2020) - [j2]Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif:
The Log-Approximate-Rank Conjecture Is False. J. ACM 67(4): 23:1-23:28 (2020) - [c8]Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar:
Quantum Query-To-Communication Simulation Needs a Logarithmic Overhead. CCC 2020: 32:1-32:15 - [c7]Nikhil S. Mande, Swagato Sanyal:
On Parity Decision Trees for Fourier-Sparse Boolean Functions. FSTTCS 2020: 29:1-29:16 - [c6]Nikhil S. Mande, Justin Thaler, Shuchen Zhu:
Improved Approximate Degree Bounds for k-Distinctness. TQC 2020: 2:1-2:22 - [i20]Nikhil S. Mande, Justin Thaler, Shuchen Zhu:
Improved Approximate Degree Bounds For k-distinctness. CoRR abs/2002.08389 (2020) - [i19]Nikhil S. Mande, Swagato Sanyal:
On parity decision trees for Fourier-sparse Boolean functions. CoRR abs/2008.00266 (2020) - [i18]Sourav Chakraborty, Nikhil S. Mande, Rajat Mittal, Tulasimohan Molli, Manaswi Paraashar, Swagato Sanyal:
Tight Chang's-lemma-type bounds for Boolean functions. CoRR abs/2012.02335 (2020) - [i17]Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf:
Symmetry and Quantum Query-to-Communication Simulation. CoRR abs/2012.05233 (2020) - [i16]Nikhil S. Mande, Swagato Sanyal:
On parity decision trees for Fourier-sparse Boolean functions. Electron. Colloquium Comput. Complex. TR20 (2020) - [i15]Nikhil S. Mande, Justin Thaler, Shuchen Zhu:
Improved Approximate Degree Bounds For $k$-distinctness. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c5]Andrej Bogdanov, Nikhil S. Mande, Justin Thaler, Christopher Williamson:
Approximate Degree, Secret Sharing, and Concentration Phenomena. APPROX-RANDOM 2019: 71:1-71:21 - [c4]Mark Bun, Nikhil S. Mande, Justin Thaler:
Sign-Rank Can Increase Under Intersection. ICALP 2019: 30:1-30:14 - [c3]Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif:
The log-approximate-rank conjecture is false. STOC 2019: 42-53 - [i14]Arkadev Chattopadhyay, Meena Mahajan, Nikhil S. Mande, Nitin Saurabh:
Lower Bounds for Linear Decision Lists. CoRR abs/1901.05911 (2019) - [i13]Mark Bun, Nikhil S. Mande, Justin Thaler:
Sign-Rank Can Increase Under Intersection. CoRR abs/1903.00544 (2019) - [i12]Andrej Bogdanov, Nikhil S. Mande, Justin Thaler, Christopher Williamson:
Approximate degree, secret sharing, and concentration phenomena. CoRR abs/1906.00326 (2019) - [i11]Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar:
Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead. CoRR abs/1909.10428 (2019) - [i10]Andrej Bogdanov, Nikhil S. Mande, Justin Thaler, Christopher Williamson:
Approximate degree, secret sharing, and concentration phenomena. Electron. Colloquium Comput. Complex. TR19 (2019) - [i9]Mark Bun, Nikhil S. Mande, Justin Thaler:
Sign-Rank Can Increase Under Intersection. Electron. Colloquium Comput. Complex. TR19 (2019) - [i8]Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar:
Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead. Electron. Colloquium Comput. Complex. TR19 (2019) - [i7]Arkadev Chattopadhyay, Meena Mahajan, Nikhil S. Mande, Nitin Saurabh:
Lower Bounds for Linear Decision Lists. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j1]Arkadev Chattopadhyay, Nikhil S. Mande:
Separation of Unbounded-Error Models in Multi-Party Communication Complexity. Theory Comput. 14(1): 1-23 (2018) - [c2]Arkadev Chattopadhyay, Nikhil S. Mande:
A Short List of Equalities Induces Large Sign Rank. FOCS 2018: 47-58 - [i6]Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif:
The Log-Approximate-Rank Conjecture is False. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c1]Arkadev Chattopadhyay, Nikhil S. Mande:
A Lifting Theorem with Applications to Symmetric Functions. FSTTCS 2017: 23:1-23:14 - [i5]Arkadev Chattopadhyay, Nikhil S. Mande:
Dual polynomials and communication complexity of XOR functions. CoRR abs/1704.02537 (2017) - [i4]Arkadev Chattopadhyay, Nikhil S. Mande:
Weights at the Bottom Matter When the Top is Heavy. CoRR abs/1705.02397 (2017) - [i3]Arkadev Chattopadhyay, Nikhil S. Mande:
Dual polynomials and communication complexity of XOR functions. Electron. Colloquium Comput. Complex. TR17 (2017) - [i2]Arkadev Chattopadhyay, Nikhil S. Mande:
Weights at the Bottom Matter When the Top is Heavy. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i1]Arkadev Chattopadhyay, Nikhil S. Mande:
Small Error Versus Unbounded Error Protocols in the NOF Model. Electron. Colloquium Comput. Complex. TR16 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 20:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
