default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSuhail Sherif
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif
, Morgan Shirley, Adi Shraibman:
An Improved Protocol for ExactlyN with More Than 3 Players. ITCS 2024: 58:1-58:23- [i10]Pavel Dvorák, Bruno Loff, Suhail Sherif:
A Quantum Pigeonhole Principle and Two Semidefinite Relaxations of Communication Complexity. CoRR abs/2409.04592 (2024) - 2023
- [c6]Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal, Suhail Sherif:
Lifting to Parity Decision Trees via Stifling. ITCS 2023: 33:1-33:20 - [i9]Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman:
An improved protocol for ExactlyN with more than 3 players. CoRR abs/2309.06554 (2023) - [i8]Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman:
An improved protocol for ExactlyN with more than 3 players. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c5]Nikhil S. Mande, Swagato Sanyal, Suhail Sherif:
One-Way Communication Complexity and Non-Adaptive Decision Trees. STACS 2022: 49:1-49:24 - [i7]Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal, Suhail Sherif:
Lifting to Parity Decision Trees Via Stifling. CoRR abs/2211.17214 (2022) - [i6]Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal, Suhail Sherif:
Lifting to Parity Decision Trees Via Stifling. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c4]Arkadev Chattopadhyay, Ankit Garg, Suhail Sherif:
Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture. FSTTCS 2021: 13:1-13:16 - [c3]Ankit Garg, Robin Kothari, Praneeth Netrapalli, Suhail Sherif:
No Quantum Speedup over Gradient Descent for Non-Smooth Convex Optimization. ITCS 2021: 53:1-53:20 - [c2]Ankit Garg, Robin Kothari, Praneeth Netrapalli, Suhail Sherif:
Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness. NeurIPS 2021: 29874-29884 - [i5]Ankit Garg, Robin Kothari, Praneeth Netrapalli, Suhail Sherif:
Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness. CoRR abs/2112.01118 (2021) - 2020
- [j1]Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif:
The Log-Approximate-Rank Conjecture Is False. J. ACM 67(4): 23:1-23:28 (2020) - [i4]Arkadev Chattopadhyay, Ankit Garg, Suhail Sherif:
Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture. CoRR abs/2009.02717 (2020) - [i3]Ankit Garg, Robin Kothari, Praneeth Netrapalli, Suhail Sherif:
No quantum speedup over gradient descent for non-smooth convex optimization. CoRR abs/2010.01801 (2020) - [i2]Arkadev Chattopadhyay, Ankit Garg, Suhail Sherif:
Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c1]Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif:
The log-approximate-rank conjecture is false. STOC 2019: 42-53 - 2018
- [i1]Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif:
The Log-Approximate-Rank Conjecture is False. Electron. Colloquium Comput. Complex. TR18 (2018)
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 2025-01-04 03:27 CET 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:
