| An asymptotically optimal algorithm for maximum matching in dynamic streams S Assadi, V Shah arXiv preprint arXiv:2201.12710, 2022 | 12 | 2022 |
| Streaming algorithms and lower bounds for estimating correlation clustering cost S Assadi, V Shah, C Wang Advances in Neural Information Processing Systems 36, 75201-75213, 2023 | 2 | 2023 |
| Generalizing Greenwald-Khanna Streaming Quantile Summaries for Weighted Inputs S Assadi, N Joshi, M Prabhu, V Shah arXiv preprint arXiv:2303.06288, 2023 | 2 | 2023 |
| Tight bounds for vertex connectivity in dynamic streams S Assadi, V Shah Symposium on Simplicity in Algorithms (SOSA), 213-227, 2023 | 1 | 2023 |
| Space optimal vertex cover in dynamic streams KK Naidu, V Shah arXiv preprint arXiv:2209.05623, 2022 | 1 | 2022 |
| Learning-augmented Maximum Independent Set V Braverman, P Dharangutte, V Shah, C Wang arXiv preprint arXiv:2407.11364, 2024 | | 2024 |
| New Lower Bounds in Merlin-Arthur Communication and Graph Streaming Verification P Ghosh, V Shah arXiv preprint arXiv:2401.06378, 2024 | | 2024 |
| LIPIcs, Volume 215, ITCS 2022, Complete Volume}} M Braverman, G Aggarwal, K Bhawalkar, G Guruganesh, A Perlroth, ... 13th Innovations in Theoretical Computer Science Conference (ITCS 2022) 215 …, 2022 | | 2022 |
