Seguir
Vihan Shah
Vihan Shah
PhD student at the University of Waterloo
Dirección de correo verificada de uwaterloo.ca - Página principal
Título
Citado por
Citado por
Año
An asymptotically optimal algorithm for maximum matching in dynamic streams
S Assadi, V Shah
arXiv preprint arXiv:2201.12710, 2022
102022
Streaming Algorithms and Lower Bounds for Estimating Correlation Clustering Cost
S Assadi, V Shah, C Wang
Advances in Neural Information Processing Systems 36, 2024
12024
Tight bounds for vertex connectivity in dynamic streams
S Assadi, V Shah
Symposium on Simplicity in Algorithms (SOSA), 213-227, 2023
12023
Space optimal vertex cover in dynamic streams
KK Naidu, V Shah
arXiv preprint arXiv:2209.05623, 2022
12022
New Lower Bounds in Merlin-Arthur Communication and Graph Streaming Verification
P Ghosh, V Shah
arXiv preprint arXiv:2401.06378, 2024
2024
Generalizing Greenwald-Khanna Streaming Quantile Summaries for Weighted Inputs
S Assadi, N Joshi, M Prabhu, V Shah
arXiv preprint arXiv:2303.06288, 2023
2023
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–6