Vihan Shah

According to our database, Vihan Shah authored at least 11 papers between 2022 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Sublinear-Time Lower Bounds for Approximating Matching Size using Non-Adaptive Queries.

Vihan Shah

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs Using Fast Matrix Multiplication.

Sepehr Assadi, Vihan Shah

Proc. ACM Manag. Data, May, 2025

Space Complexity of Minimum Cut Problems in Single-Pass Streams.

Matthew Ding, Alexandro Garces, Jason Li, Honghao Lin, Jelani Nelson, Vihan Shah, David P. Woodruff

Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time.

Vladimir Braverman, Prathamesh Dharangutte, Shreyas Pai, Vihan Shah, Chen Wang

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2025

2024

New Lower Bounds in Merlin-Arthur Communication and Graph Streaming Verification.

Prantar Ghosh, Vihan Shah

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Learning-Augmented Maximum Independent Set.

Vladimir Braverman, Prathamesh Dharangutte, Vihan Shah, Chen Wang

Proceedings of the Approximation, 2024

2023

Tight Bounds for Vertex Connectivity in Dynamic Streams.

Sepehr Assadi, Vihan Shah

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Streaming Algorithms and Lower Bounds for Estimating Correlation Clustering Cost.

Sepehr Assadi, Vihan Shah, Chen Wang

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Generalizing Greenwald-Khanna Streaming Quantile Summaries for Weighted Inputs.

Sepehr Assadi, Nirmit Joshi, Milind Prabhu, Vihan Shah

Proceedings of the 26th International Conference on Database Theory, 2023

2022

An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams.

Sepehr Assadi, Vihan Shah

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Space Optimal Vertex Cover in Dynamic Streams.

Kheeran K. Naidu, Vihan Shah

Proceedings of the Approximation, 2022