Vihan Shah - RankMe

21 papers A* 2A 7Journal 11Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Sublinear-Time Lower Bounds for Approximating Matching Size using Non-Adaptive Queries. SODA Vihan Shah
2026	J	`jnl`	Sublinear-Time Lower Bounds for Approximating Matching Size using Non-Adaptive Queries. CoRR Vihan Shah
2025	J	`jnl`	An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs Using Fast Matrix Multiplication. Proc. ACM Manag. Data Sepehr Assadi, Vihan Shah
2025	J	`jnl`	An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs using Fast Matrix Multiplication. CoRR Sepehr Assadi, Vihan Shah
2025	A	`conf`	Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time. AISTATS Vladimir Braverman, Prathamesh Dharangutte, Shreyas Pai, Vihan Shah, Chen Wang
2025	A	`conf`	Space Complexity of Minimum Cut Problems in Single-Pass Streams. ITCS Matthew Ding, Alexandro Garces, Jason Li, Honghao Lin, Jelani Nelson, Vihan Shah, David P. Woodruff
2024	J	`jnl`	Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time. CoRR Vladimir Braverman, Prathamesh Dharangutte, Shreyas Pai, Vihan Shah, Chen Wang
2024	A	`conf`	Learning-Augmented Maximum Independent Set. APPROX/RANDOM Vladimir Braverman, Prathamesh Dharangutte, Vihan Shah, Chen Wang
2024	J	`jnl`	Learning-augmented Maximum Independent Set. CoRR Vladimir Braverman, Prathamesh Dharangutte, Vihan Shah, Chen Wang
2024	A	`conf`	New Lower Bounds in Merlin-Arthur Communication and Graph Streaming Verification. ITCS Prantar Ghosh, Vihan Shah
2024	J	`jnl`	New Lower Bounds in Merlin-Arthur Communication and Graph Streaming Verification. CoRR Prantar Ghosh, Vihan Shah
2024	J	`jnl`	Space Complexity of Minimum Cut Problems in Single-Pass Streams. CoRR Matthew Ding, Alexandro Garces, Jason Li, Honghao Lin, Jelani Nelson, Vihan Shah, David P. Woodruff
2023	A	`conf`	Generalizing Greenwald-Khanna Streaming Quantile Summaries for Weighted Inputs. ICDT Sepehr Assadi, Nirmit Joshi, Milind Prabhu, Vihan Shah
2023	J	`jnl`	Generalizing Greenwald-Khanna Streaming Quantile Summaries for Weighted Inputs. CoRR Sepehr Assadi, Nirmit Joshi, Milind Prabhu, Vihan Shah
2023	A*	`conf`	Streaming Algorithms and Lower Bounds for Estimating Correlation Clustering Cost. NeurIPS Sepehr Assadi, Vihan Shah, Chen Wang
2023	—	`conf`	Tight Bounds for Vertex Connectivity in Dynamic Streams. SOSA Sepehr Assadi, Vihan Shah
2022	A	`conf`	An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams. ITCS Sepehr Assadi, Vihan Shah
2022	J	`jnl`	An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams. CoRR Sepehr Assadi, Vihan Shah
2022	A	`conf`	Space Optimal Vertex Cover in Dynamic Streams. APPROX/RANDOM Kheeran K. Naidu, Vihan Shah
2022	J	`jnl`	Space Optimal Vertex Cover in Dynamic Streams. CoRR Kheeran K. Naidu, Vihan Shah
2022	J	`jnl`	Tight Bounds for Vertex Connectivity in Dynamic Streams. CoRR Sepehr Assadi, Vihan Shah