| An asymptotically optimal algorithm for maximum matching in dynamic streams S Assadi, V Shah arXiv preprint arXiv:2201.12710, 2022 | 15 | 2022 |
| Tight bounds for vertex connectivity in dynamic streams S Assadi, V Shah Symposium on Simplicity in Algorithms (SOSA), 213-227, 2023 | 5 | 2023 |
| Learning-augmented maximum independent set V Braverman, P Dharangutte, V Shah, C Wang arXiv preprint arXiv:2407.11364, 2024 | 3 | 2024 |
| 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 | 3 | 2023 |
| Generalizing Greenwald-Khanna streaming quantile summaries for weighted inputs S Assadi, N Joshi, M Prabhu, V Shah arXiv preprint arXiv:2303.06288, 2023 | 3 | 2023 |
| Space optimal vertex cover in dynamic streams KK Naidu, V Shah arXiv preprint arXiv:2209.05623, 2022 | 2 | 2022 |
| New lower bounds in merlin-arthur communication and graph streaming verification P Ghosh, V Shah arXiv preprint arXiv:2401.06378, 2024 | 1 | 2024 |
| An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs V Shah Ontario DataBase Day–Program, 11, 2024 | | 2024 |
| Space complexity of minimum cut problems in single-pass streams M Ding, A Garces, J Li, H Lin, J Nelson, V Shah, DP Woodruff arXiv preprint arXiv:2412.01143, 2024 | | 2024 |
| Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time V Braverman, P Dharangutte, S Pai, V Shah, C Wang arXiv preprint arXiv:2411.09979, 2024 | | 2024 |
| 26th International Conference on Database Theory (ICDT 2023) N Francis, A Gheerbrant, P Guagliardo, L Libkin, V Marsault, W Martens, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2023 | | 2023 |
| 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, 9, 2022 | | 2022 |
Sepehr AssadiUniversity of WaterlooVerified email at assadi.info
