Suhail Sherif

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 17

Top Topics

Interior Point Methods

Coloured Petri Nets

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman
An Improved Protocol for ExactlyN with More Than 3 Players. ITCS (2024)
Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman
An improved protocol for ExactlyN with more than 3 players. Electron. Colloquium Comput. Complex. (2023)
Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal, Suhail Sherif
Lifting to Parity Decision Trees via Stifling. ITCS (2023)
Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman
An improved protocol for ExactlyN with more than 3 players. CoRR (2023)
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)
Ankit Garg, Robin Kothari, Praneeth Netrapalli, Suhail Sherif
No Quantum Speedup over Gradient Descent for Non-Smooth Convex Optimization. ITCS (2021)
Ankit Garg, Robin Kothari, Praneeth Netrapalli, Suhail Sherif
Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness. NeurIPS (2021)
Ankit Garg, Robin Kothari, Praneeth Netrapalli, Suhail Sherif
Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness. CoRR (2021)
Arkadev Chattopadhyay, Ankit Garg, Suhail Sherif
Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture. FSTTCS (2021)
Ankit Garg, Robin Kothari, Praneeth Netrapalli, Suhail Sherif
No quantum speedup over gradient descent for non-smooth convex optimization. CoRR (2020)
Arkadev Chattopadhyay, Ankit Garg, Suhail Sherif
Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture. CoRR (2020)
Arkadev Chattopadhyay, Ankit Garg, Suhail Sherif
Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture. 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)
Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif
The log-approximate-rank conjecture is false. STOC (2019)
Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif
The Log-Approximate-Rank Conjecture is False. Electron. Colloquium Comput. Complex. 25 (2018)