Fetching the paper…
Reading the bibliography…
For over a decade now we have been witnessing the success of {\em massive parallel computation} (MPC) frameworks, such as MapReduce, Hadoop, Dryad, or Spark.
Paths, trees and flowers
Jack Edmonds · 1965
Earlier work this paper cites.
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.
An improved parallel algorithm for maximal matching
Amos Israeli and Yossi Shiloach · 1986
Earlier work this paper cites.
A simple parallel algorithm for the maximal independent set problem
Michael Luby · 1986
Earlier work this paper cites.
Optimal bounds for decision problems on the CRCW PRAM
Paul Beame and Johan Hastad · 1987
Earlier work this paper cites.
A faster distributed algorithm for computing maximal matchings deterministically
Michał Hańćkowiak, Michał Karoński, and Alessandro Panconesi · 1999
Earlier work this paper cites.
On the distributed complexity of computing maximal matchings
Michał Hańćkowiak, Michał Karoński, and Alessandro Panconesi · 2001
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.
The price of being near-sighted
Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer · 2006
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
Cited alongside, same era.
On distributing symmetric streaming computations
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, and Zoya Svitkina · 2010
Cited alongside, same era.
A model of computation for MapReduce
Howard J. Karloff, Siddharth Suri, and Sergei Vassilvitskii · 2010
Cited alongside, same era.
Maintaining a large matching and a small vertex cover
Krzysztof Onak and Ronitt Rubinfeld · 2010
Cited alongside, same era.
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
Deterministic fully dynamic data structures for vertex cover and matching
Sayan Bhattacharya, Monika Henzinger, and Giuseppe F. Italiano · 2015
Later among the works it cites.
Fully dynamic matching in bipartite graphs
Aaron Bernstein and Cliff Stein · 2015
Later among the works it cites.
Communication complexity of approximate matching in distributed graphs
Zengfeng Huang, Božidar Radunović, Milan Vojnović, and Qin Zhang · 2015
Later among the works it cites.
Improved distributed approximate matching
Zvi Lotker, Boaz Patt-Shamir, and Seth Pettie · 2015
Later among the works it cites.
New deterministic approximation algorithms for fully dynamic matching
Sayan Bhattacharya, Monika Henzinger, and Danupon Nanongkai · 2016
Later among the works it cites.
Faster fully dynamic matchings with small approximation ratios
Aaron Bernstein and Cliff Stein · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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.
Communication steps for parallel query processing
Paul Beame, Paraschos Koutris, and Dan Suciu · 2013
Cited alongside, same era.
Parallel algorithms for geometric graph problems
Alexandr Andoni, Aleksandar Nikolov, Krzysztof Onak, and Grigory Yaroslavtsev · 2014
Cited alongside, same era.
Skew in parallel query processing
Paul Beame, Paraschos Koutris, and Dan Suciu · 2014
Cited alongside, same era.
Approximating matching size from random streams
Michael Kapralov, Sanjeev Khanna, and Madhu Sudan · 2014
Cited alongside, same era.
Later among the works it cites.
Shuffles and circuits: On lower bounds for modern parallel computation
Tim Roughgarden, Sergei Vassilvitskii, and Joshua R. Wang · 2016
Later among the works it cites.
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
Closest in time.
Randomized composable coresets for matching and vertex cover
Sepehr Assadi and Sanjeev Khanna · 2017
Closest in time.
Simple round compression for parallel vertex cover
Sepehr Assadi · 2017
Closest in time.
Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time
Sayan Bhattacharya, Deeparnab Chakrabarty, and Monika Henzinger · 2017
Closest in time.
Fully dynamic approximate maximum matching and minimum vertex cover in O ( log 3 n ) O(\log^{3}n) worst case update time
Sayan Bhattacharya, Monika Henzinger, and Danupon Nanongkai · 2017
Closest in time.
Deterministic distributed matching: Simpler, faster, better
Manuela Fischer and Mohsen Ghaffari · 2017
Closest in time.