279 citations · 500 across the 42 of their papers we have counts for
Showing 2017 · cs.DSShow all
3 papers · 2 filters
cs.DS2017★ 3 cited
Randomized Composable Coresets for Matching and Vertex Cover
Sepehr Assadi, Sanjeev Khanna
A common approach for designing scalable algorithms for massive data sets is to distribute the computation across, say , machines and process the data using limited communicatio…
cs.DS2017★ 8 cited
The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm
Sepehr Assadi, Sanjeev Khanna, Yang Li
In the stochastic matching problem, we are given a general (not necessarily bipartite) graph , where each edge in is realized with some constant probability and…
cs.DS2017★ 65 cited
On Estimating Maximum Matching Size in Graph Streams
Sepehr Assadi, Sanjeev Khanna, Yang Li
We study the problem of estimating the maximum matching size in graphs whose edges are revealed in a streaming manner. We consider both insertion-only streams and dynamic streams a…