| The Log-Approximate-Rank Conjecture Is False A Chattopadhyay, NS Mande, S Sherif Journal of the ACM (JACM) 67 (4), 1-28, 2020 | 41 | 2020 |
| No quantum speedup over gradient descent for non-smooth convex optimization A Garg, R Kothari, P Netrapalli, S Sherif arXiv preprint arXiv:2010.01801, 2020 | 13 | 2020 |
| Near-optimal lower bounds for convex optimization for all orders of smoothness A Garg, R Kothari, P Netrapalli, S Sherif Advances in Neural Information Processing Systems 34, 29874-29884, 2021 | 8 | 2021 |
| Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture A Chattopadhyay, A Garg, S Sherif arXiv preprint arXiv:2009.02717, 2020 | 6 | 2020 |
| Lifting to Parity Decision Trees Via Stifling A Chattopadhyay, NS Mande, S Sanyal, S Sherif arXiv preprint arXiv:2211.17214, 2022 | 4 | 2022 |
| Communication Complexity and Quantum Optimization Lower Bounds via Query Complexity S Sherif PhD thesis, Tata Institute of Fundamental Research, Mumbai, 2021 | 2 | 2021 |
| An improved protocol for ExactlyN with more than 3 players L Hambardzumyan, T Pitassi, S Sherif, M Shirley, A Shraibman arXiv preprint arXiv:2309.06554, 2023 | 1 | 2023 |
| One-way communication complexity and non-adaptive decision trees NS Mande, S Sanyal, S Sherif arXiv preprint arXiv:2105.01963, 2021 | 1 | 2021 |
