4 citations · 16 across the 32 of their papers we have counts for
4 papers · 1 filter
Stochastic Matching with Few Queries: New Algorithms and Tools
Soheil Behnezhad, Alireza Farhadi, MohammadTaghi Hajiaghayi +1
We consider the following stochastic matching problem on both weighted and unweighted graphs: A graph along with a parameter is given in the input. Each ed…
Massively Parallel Dynamic Programming on Trees
MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan +2
Dynamic programming is a powerful technique that is, unfortunately, often inherently sequential. That is, there exists no unified method to parallelize algorithms that use dynamic…
Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi +1
The success of modern parallel paradigms such as MapReduce, Hadoop, or Spark, has attracted a significant attention to the Massively Parallel Computation (MPC) model over the past…
Semi-MapReduce Meets Congested Clique
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi
Graph problems are troublesome when it comes to MapReduce. Typically, to be able to design algorithms that make use of the advantages of MapReduce, assumptions beyond what the mode…