Obserwuj
Vihan Shah
Vihan Shah
PhD student at the University of Waterloo
Zweryfikowany adres z uwaterloo.ca - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
An asymptotically optimal algorithm for maximum matching in dynamic streams
S Assadi, V Shah
arXiv preprint arXiv:2201.12710, 2022
142022
Learning-augmented maximum independent set
V Braverman, P Dharangutte, V Shah, C Wang
arXiv preprint arXiv:2407.11364, 2024
32024
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
32023
Tight bounds for vertex connectivity in dynamic streams
S Assadi, V Shah
Symposium on Simplicity in Algorithms (SOSA), 213-227, 2023
32023
Generalizing Greenwald-Khanna Streaming Quantile Summaries for Weighted Inputs
S Assadi, N Joshi, M Prabhu, V Shah
arXiv preprint arXiv:2303.06288, 2023
22023
Space optimal vertex cover in dynamic streams
KK Naidu, V Shah
arXiv preprint arXiv:2209.05623, 2022
22022
New Lower Bounds in Merlin-Arthur Communication and Graph Streaming Verification
P Ghosh, V Shah
arXiv preprint arXiv:2401.06378, 2024
12024
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, D 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
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
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–11