Sepehr Assadi
Rutgers, The State University of New Jersey
H-index: 25
North America-United States
Top articles of Sepehr Assadi
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
A Simple (1 — ɛ)-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching | Sepehr Assadi | 2024 | |
Rounds vs. Communication Tradeoffs for Maximal Independent Sets | SIAM Journal on Computing | Sepehr Assadi Gillat Kol Zhijun Zhang | 2024/3/25 |
Recent Advances in Multi-Pass Graph Streaming Lower Bounds | Sepehr Assadi | 2023/9/11 | |
Tight bounds for monotone minimal perfect hashing | Sepehr Assadi Martin Farach-Colton William Kuszmaul | 2023 | |
On regularity lemma and barriers in streaming and dynamic matching | Sepehr Assadi Soheil Behnezhad Sanjeev Khanna Huan Li | 2023/6/2 | |
The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits | arXiv preprint arXiv:2309.03145 | Sepehr Assadi Chen Wang | 2023/9/6 |
Passes is Optimal for Semi-Streaming Maximal Independent Set | arXiv preprint arXiv:2312.13178 | Sepehr Assadi Christian Konrad Kheeran K Naidu Janani Sundaresan | 2023/12/20 |
Evaluating Stability in Massive Social Networks: Efficient Streaming Algorithms for Structural Balance | arXiv preprint arXiv:2306.00668 | Vikrant Ashvinkumar Sepehr Assadi Chengyuan Deng Jie Gao Chen Wang | 2023/6/1 |
Fine-grained buy-many mechanisms are not much better than bundling | Sepehr Assadi Vikram Kher George Li Ariel Schvartzman | 2023/7/9 | |
Streaming Algorithms and Lower Bounds for Estimating Correlation Clustering Cost | Advances in Neural Information Processing Systems | Sepehr Assadi Vihan Shah Chen Wang | 2024/2/13 |
Generalizing Greenwald-Khanna Streaming Quantile Summaries for Weighted Inputs | arXiv preprint arXiv:2303.06288 | Sepehr Assadi Nirmit Joshi Milind Prabhu Vihan Shah | 2023/3/11 |
A Simple -Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching | arXiv preprint arXiv:2307.02968 | Sepehr Assadi | 2023/7/6 |
Optimal Multi-Pass Lower Bounds for MST in Dynamic Streams | arXiv preprint arXiv:2312.04674 | Sepehr Assadi Gillat Kol Zhijun Zhang | 2023/12/7 |
All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method | arXiv preprint arXiv:2301.07007 | Sepehr Assadi Aaron Bernstein Zachary Langley | 2023/1/17 |
Coloring in graph streams via deterministic and adversarially robust algorithms | Sepehr Assadi Amit Chakrabarti Prantar Ghosh Manuel Stoeckl | 2023/6/18 | |
Hidden Permutations to the Rescue: Multi-Pass Streaming Lower Bounds for Approximate Matchings | Sepehr Assadi Janani Sundaresan | 2023/11/6 | |
Tight Bounds for Vertex Connectivity in Dynamic Streams | Sepehr Assadi Vihan Shah | 2023 | |
(Noisy) Gap Cycle Counting Strikes Back: Random Order Streaming Lower Bounds for Connected Components and Beyond | Sepehr Assadi Janani Sundaresan | 2023/6/2 | |
Spine: Scaling up Programming-by-Negative-Example for String Filtering and Transformation | Chaoji Zuo Sepehr Assadi Dong Deng | 2022/6/10 | |
Decremental Matching in General Graphs | arXiv preprint arXiv:2207.00927 | Sepehr Assadi Aaron Bernstein Aditi Dudeja | 2022/7/3 |
Co-Authors
