Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDNikhil S. Mande
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 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. Computational Complexity Conference 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, Justin Thaler, Shuchen Zhu:
Improved Approximate Degree Bounds For $k$-distinctness. Electron. Colloquium Comput. Complex. 27: 20 (2020) - [i15]Nikhil S. Mande, Swagato Sanyal:
On parity decision trees for Fourier-sparse Boolean functions. Electron. Colloquium Comput. Complex. 27: 119 (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]Arkadev Chattopadhyay, Meena Mahajan, Nikhil S. Mande, Nitin Saurabh:
Lower Bounds for Linear Decision Lists. Electron. Colloquium Comput. Complex. 26: 7 (2019) - [i9]Mark Bun, Nikhil S. Mande, Justin Thaler:
Sign-Rank Can Increase Under Intersection. Electron. Colloquium Comput. Complex. 26: 27 (2019) - [i8]Andrej Bogdanov, Nikhil S. Mande, Justin Thaler, Christopher Williamson:
Approximate degree, secret sharing, and concentration phenomena. Electron. Colloquium Comput. Complex. 26: 82 (2019) - [i7]Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar:
Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead. Electron. Colloquium Comput. Complex. 26: 136 (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. 25: 176 (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. 24: 62 (2017) - [i2]Arkadev Chattopadhyay, Nikhil S. Mande:
Weights at the Bottom Matter When the Top is Heavy. Electron. Colloquium Comput. Complex. 24: 83 (2017) - 2016
- [i1]Arkadev Chattopadhyay, Nikhil S. Mande:
Small Error Versus Unbounded Error Protocols in the NOF Model. Electron. Colloquium Comput. Complex. 23: 95 (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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2021-02-12 21:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
