Suhail Sherif

19 papers A* 2A 5Journal 11Unranked 1
YearRankTypeTitle / Venue / Authors
2026 A conf
A Quantum Pigeonhole Principle and Two Semidefinite Relaxations of Communication Complexity.
STACS
Pavel Dvorák, Bruno Loff, Suhail Sherif
2024 J jnl
A Quantum Pigeonhole Principle and Two Semidefinite Relaxations of Communication Complexity.
CoRR
Pavel Dvorák, Bruno Loff, Suhail Sherif
2024 A conf
An Improved Protocol for ExactlyN with More Than 3 Players.
ITCS
Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman
2023 J jnl
An improved protocol for ExactlyN with more than 3 players.
CoRR
Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman
2023 J jnl
An improved protocol for ExactlyN with more than 3 players.
Electron. Colloquium Comput. Complex.
Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman
2023 A conf
Lifting to Parity Decision Trees via Stifling.
ITCS
Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal, Suhail Sherif
2022 J jnl
Lifting to Parity Decision Trees Via Stifling.
CoRR
Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal, Suhail Sherif
2022 J jnl
Lifting to Parity Decision Trees Via Stifling.
Electron. Colloquium Comput. Complex.
Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal, Suhail Sherif
2022 A conf
One-Way Communication Complexity and Non-Adaptive Decision Trees.
STACS
Nikhil S. Mande, Swagato Sanyal, Suhail Sherif
2021 A* conf
Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness.
NeurIPS
Ankit Garg, Robin Kothari, Praneeth Netrapalli, Suhail Sherif
2021 J jnl
Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness.
CoRR
Ankit Garg, Robin Kothari, Praneeth Netrapalli, Suhail Sherif
2021 A conf
No Quantum Speedup over Gradient Descent for Non-Smooth Convex Optimization.
ITCS
Ankit Garg, Robin Kothari, Praneeth Netrapalli, Suhail Sherif
2021 — conf
Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture.
FSTTCS
Arkadev Chattopadhyay, Ankit Garg, Suhail Sherif
2020 J jnl
No quantum speedup over gradient descent for non-smooth convex optimization.
CoRR
Ankit Garg, Robin Kothari, Praneeth Netrapalli, Suhail Sherif
2020 J jnl
The Log-Approximate-Rank Conjecture Is False.
J. ACM
Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif
2020 J jnl
Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture.
CoRR
Arkadev Chattopadhyay, Ankit Garg, Suhail Sherif
2020 J jnl
Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture.
Electron. Colloquium Comput. Complex.
Arkadev Chattopadhyay, Ankit Garg, Suhail Sherif
2019 A* conf
The log-approximate-rank conjecture is false.
STOC
Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif
2018 J jnl
The Log-Approximate-Rank Conjecture is False.
Electron. Colloquium Comput. Complex.
Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif