Suhail Sherif

According to our database, Suhail Sherif authored at least 8 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

A Quantum Pigeonhole Principle and Two Semidefinite Relaxations of Communication Complexity.

Pavel Dvorák, Bruno Loff, Suhail Sherif

CoRR, 2024

An Improved Protocol for ExactlyN with More Than 3 Players.

Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023

Lifting to Parity Decision Trees via Stifling.

Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal, Suhail Sherif

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022

One-Way Communication Complexity and Non-Adaptive Decision Trees.

Nikhil S. Mande, Swagato Sanyal, Suhail Sherif

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2021

Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness.

Ankit Garg, Robin Kothari, Praneeth Netrapalli, Suhail Sherif

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

No Quantum Speedup over Gradient Descent for Non-Smooth Convex Optimization.

Ankit Garg, Robin Kothari, Praneeth Netrapalli, Suhail Sherif

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture.

Arkadev Chattopadhyay, Ankit Garg, Suhail Sherif

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2019

The log-approximate-rank conjecture is false.

Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019