Publications

Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman (2023). An improved protocol for ExactlyN with more than 3 players.

Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif, Swagato Sanyal (2023). Lifting to Parity Decision Trees via Stifling. ITCS 2023.

Cite arXiv Talk Video

Nikhil S. Mande, Swagato Sanyal, Suhail Sherif (2022). One-Way Communication Complexity and Non-Adaptive Decision Trees. STACS 2022.

Suhail Sherif (2021). Communication Complexity and Quantum Optimization Lower Bounds via Query Complexity. PhD Thesis.

Arkadev Chattopadhyay, Ankit Garg, Suhail Sherif (2021). Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture. FSTTCS 2021.

Cite arXiv Talk Video

Ankit Garg, Robin Kothari, Praneeth Netrapalli, Suhail Sherif (2021). No Quantum Speedup over Gradient Descent for Non-Smooth Convex Optimization. ITCS 2021.

Cite arXiv Talk Video

Ankit Garg, Robin Kothari, Praneeth Netrapalli, Suhail Sherif (2021). Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness. NeurIPS 2021.

Cite arXiv Talk Video

Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif (2020). The Log-Approximate-Rank Conjecture Is False. Journal of the ACM.

Cite ECCC Talk Slides