Semi-MapReduce Meets Congested Clique

Distributed computing

David Peleg · 2000

Earlier work this paper cites.

On graph problems in a semi-streaming model

Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, and Jian Zhang · 2005

Earlier work this paper cites.

A model of computation for MapReduce

Howard Karloff, Siddharth Suri, and Sergei Vassilvitskii · 2010

Earlier work this paper cites.

Sorting, searching, and simulation in the mapreduce framework

Michael T Goodrich, Nodari Sitchinava, and Qin Zhang · 2011

Earlier work this paper cites.

Filtering: a method for solving graph problems in mapreduce

Silvio Lattanzi, Benjamin Moseley, Siddharth Suri, and Sergei Vassilvitskii · 2011

Earlier work this paper cites.

Communication Steps for Parallel Query Processing

Paul Beame, Paraschos Koutris, and Dan Suciu · 2013

Earlier work this paper cites.

Optimal deterministic routing and sorting on the congested clique

Christoph Lenzen · 2013

Cited alongside, same era.

On the power of the congested clique model

Andrew Drucker, Fabian Kuhn, and Rotem Oshman · 2014

Cited alongside, same era.

Lessons from the congested clique applied to MapReduce

James W Hegeman and Sriram V Pemmaraju · 2015

Cited alongside, same era.

Shuffles and circuits:(on lower bounds for modern parallel computation)

Tim Roughgarden, Sergei Vassilvitskii, and Joshua R Wang · 2016

Cited alongside, same era.

Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs

Original

Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab Mirrokni, and Cliff Stein · 2017

Cited alongside, same era.

Affinity Clustering: Hierarchical Clustering at Scale

MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Raimondas Kiveris, Silvio Lattanzi, and Vahab Mirrokni · 2017

Later among the works it cites.

Massively Parallel Algorithms and Hardness for Single-Linkage Clustering Under ℓ p \ell_{p} -Distances

Original

Grigory Yaroslavtsev and Adithya Vadapalli · 2017

Later among the works it cites.

Round Compression for Parallel Matching Algorithms

Artur Czumaj, Jakub Łącki, Aleksander Mądry, Slobodan Mitrović, Krzysztof Onak, and Piotr Sankowski · 2018

Closest in time.

Improved massively parallel computation algorithms for mis, matching, and vertex cover

Mohsen Ghaffari, Themis Gouleakis, Slobodan Mitrović, and Ronitt Rubinfeld · 2018

Closest in time.

MST in O ⁡ ( 1 ) O(1) Rounds of Congested Clique

Tomasz Jurdziński and Krzysztof Nowicki · 2018

Closest in time.