| Memory bounds for the experts problem V Srinivas, DP Woodruff, Z Xu, S Zhou Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 24 | 2022 |
| The Burer-Monteiro SDP method can fail even above the Barvinok-Pataki bound L O'Carroll, V Srinivas, A Vijayaraghavan Advances in Neural Information Processing Systems 35, 31254-31264, 2022 | 5 | 2022 |
| The Predicted-Deletion Dynamic Model: Taking Advantage of ML Predictions, for Free QC Liu, V Srinivas arXiv preprint arXiv:2307.08890, 2023 | 3 | 2023 |
| The Predicted-Updates Dynamic Model: Offline, Incremental, and Decremental to Fully Dynamic Transformations QC Liu, V Srinivas The Thirty Seventh Annual Conference on Learning Theory, 3582-3641, 2024 | | 2024 |
| New Tools for Smoothed Analysis: Least Singular Value Bounds for Random Matrices with Dependent Entries A Bhaskara, E Evert, V Srinivas, A Vijayaraghavan Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 375-386, 2024 | | 2024 |
| Competitive strategies to use" warm start" algorithms with predictions V Srinivas, A Blum arXiv preprint arXiv:2405.03661, 2024 | | 2024 |
| SCS Senior Thesis Simpler Approximations for the Network Steiner-Tree Problem V Srinivas | | 2020 |
