The Log-Approximate-Rank Conjecture is False. - Arkadev Chattopadhyay; Nikhil S. Mande; Suhail Sherif (Electron. Colloquium Comput. Complex., 2018)

Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture. - Arkadev Chattopadhyay; Ankit Garg; Suhail Sherif (Electron. Colloquium Comput. Complex., 2020)

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

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

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

Lifting to Parity Decision Trees Via Stifling. - Arkadev Chattopadhyay; Nikhil S. Mande; Swagato Sanyal; Suhail Sherif (Electron. Colloquium Comput. Complex., 2022)

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

A Quantum Pigeonhole Principle and Two Semidefinite Relaxations of Communication Complexity. - Pavel Dvorák; Bruno Loff; Suhail Sherif (CoRR, 2024)