61 citations · 206 across the 60 of their papers we have counts for
3 papers · 1 filter
Improved Communication Complexity of Fault-Tolerant Consensus
MohammadTaghi HajiAghayi, Dariusz R. Kowalski, Jan Olkowski
Consensus is one of the most thoroughly studied problems in distributed computing, yet there are still complexity gaps that have not been bridged for decades. In particular, in the…
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…