Sepehr Assadi
2 indexed papers
Recent (6 mo)
2With code
0Influential cites
0Benchmarked
0Publications per year
226
Top categories
Algorithms×2Complexity×2
Frequent co-authors
Research Timeline
2026
Semi-Streaming Matching in a Single Pass II: Greedy is Optimal
This paper proves that no single-pass semi-streaming algorithm can achieve a better-than-half approximation to the maximum matching problem, implying the optimality of the naive greedy algorithm.
Semi-Streaming Matching in a Single Pass I: A New Framework for Lower Bounds via Blueprints
The paper develops a new framework for proving lower bounds for the maximum matching problem in the semi-streaming model, improving upon the previous best known bounds.
Highlighted terms show continued research focus across papers
Papers
cs.DScs.CCTheoreticalRecentJul 16, 2026
Semi-Streaming Matching in a Single Pass II: Greedy is Optimal
This paper proves that no single-pass semi-streaming algorithm can achieve a better-than-half approximation to the maximum matching problem, implying the optimality of the naive greedy algorithm.
View →
cs.DScs.CCTheoretical