Fetching the paper…
Reading the bibliography…
The Massive Parallel Computation (MPC) model is a theoretical framework for popular parallel and distributed platforms such as MapReduce, Hadoop, or Spark.
A fast and simple randomized parallel algorithm for the maximal independent set problem
Noga Alon, László Babai, and Alon Itai · 1986
Earlier work this paper cites.
A fast and simple randomized parallel algorithm for maximal matching
Amos Israeli and Alon Itai · 1986
Earlier work this paper cites.
A simple parallel algorithm for the maximal independent set problem
Michael Luby · 1986
Earlier work this paper cites.
Improved distributed algorithms for coloring and network decomposition problems
Alessandro Panconesi and Aravind Srinivasan · 1992
Earlier work this paper cites.
MapReduce: Simplified data processing on large clusters
Jeffrey Dean and Sanjay Ghemawat · 2004
Earlier work this paper cites.
Finding graph matchings in data streams
Andrew McGregor · 2005
Earlier work this paper cites.
Dryad: Distributed data-parallel programs from sequential building blocks
Michael Isard, Mihai Budiu, Yuan Yu, Andrew Birrell, and Dennis Fetterly · 2007
Earlier work this paper cites.
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
Michal Parnas and Dana Ron · 2007
Earlier work this paper cites.
MapReduce: Simplified data processing on large clusters
Jeffrey Dean and Sanjay Ghemawat · 2008
Earlier work this paper cites.
A local 2-approximation algorithm for the vertex cover problem
Matti Åstrand, Patrik Floréen, Valentin Polishchuk, Joel Rybicki, Jukka Suomela, and Jara Uitto · 2009
Earlier work this paper cites.
A model of computation for MapReduce
Howard J. Karloff, Siddharth Suri, and Sergei Vassilvitskii · 2010
Earlier work this paper cites.
Maintaining a large matching and a small vertex cover
Krzysztof Onak and Ronitt Rubinfeld · 2010
Earlier work this paper cites.
Spark: Cluster computing with working sets
Matei Zaharia, Mosharaf Chowdhury, Michael J. Franklin, Scott Shenker, and Ion Stoica · 2010
Cited alongside, same era.
Sorting, searching, and simulation in the MapReduce framework
Michael T. Goodrich, Nodari Sitchinava, and Qin Zhang · 2011
Cited alongside, same era.
Filtering: a method for solving graph problems in MapReduce
Silvio Lattanzi, Benjamin Moseley, Siddharth Suri, and Sergei Vassilvitskii · 2011
Cited alongside, same era.
Hadoop: The Definitive Guide
Tom White · 2012
Cited alongside, same era.
Parallel algorithms for geometric graph problems
Alexandr Andoni, Aleksandar Nikolov, Krzysztof Onak, and Grigory Yaroslavtsev · 2014
Cited alongside, same era.
Access to data and number of iterations: Dual primal algorithms for maximum matching under resource constraints
Parallel graph connectivity in log diameter rounds
Alexandr Andoni, Clifford Stein, Zhao Song, Zhengyu Wang, and Peilin Zhong · 2018
Closest in time.
Massively parallel algorithms for finding well-connected components in sparse graphs
Sepehr Assadi, Xiaorui Sun, and Omri Weinstein · 2018
Closest in time.
Semi-mapreduce meets congested clique
Soheil Behnezhad, Mahsa Derakhshan, and MohammadTaghi Hajiaghayi · 2018
Closest in time.
Massively parallel symmetry breaking on sparse graphs: MIS and maximal matching
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, and Richard M. Karp · 2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Kook Jin Ahn and Sudipto Guha · 2015
Cited alongside, same era.
Improved distributed approximate matching
Zvi Lotker, Boaz Patt-Shamir, and Seth Pettie · 2015
Cited alongside, same era.
An improved distributed algorithm for maximal independent set
Mohsen Ghaffari · 2016
Cited alongside, same era.
Coresets meet EDCS: algorithms for matching and vertex cover on massive graphs
Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, and Cliff Stein · 2017
Cited alongside, same era.
Randomized composable coresets for matching and vertex cover
Sepehr Assadi and Sanjeev Khanna · 2017
Cited alongside, same era.
Simple round compression for parallel vertex cover
Sepehr Assadi · 2017
Cited alongside, same era.
Communication steps for parallel query processing
Paul Beame, Paraschos Koutris, and Dan Suciu · 2017
Cited alongside, same era.
Sebastian Brandt, Manuela Fischer, and Jara Uitto · 2018
Closest in time.
Matching and MIS for uniformly sparse graphs in the low-memory MPC model
Sebastian Brandt, Manuela Fischer, and Jara Uitto · 2018
Closest in time.
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 Mitrovic, and Ronitt Rubinfeld · 2018
Closest in time.
Mohsen Ghaffari and Jara Uitto · 2018
Closest in time.
Greedy and local ratio algorithms in the mapreduce model
Nicholas J. A. Harvey, Christopher Liaw, and Paul Liu · 2018
Closest in time.
MST in O (1) rounds of congested clique
Tomasz Jurdzinski and Krzysztof Nowicki · 2018
Closest in time.
MIS in the congested clique model in o(log log Δ \Delta ) rounds
Christian Konrad · 2018
Closest in time.