12 citations · 22 across the 14 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2018★ 12 cited
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…
cs.DC2018
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…