Fetching the paper…
Reading the bibliography…
We study graph connectivity problem in MPC model.
An O ( log n ) O(\log n) parallel connectivity algorithm
Yossi Shiloach and Uzi Vishkin · 1982
Earlier work this paper cites.
Optimal bounds for decision problems on the CRCW PRAM
Paul Beame and Johan Håstad · 1989
Earlier work this paper cites.
A bridging model for parallel computation
Leslie G. Valiant · 1990
Earlier work this paper cites.
Communication-efficient parallel sorting
Michael T Goodrich · 1999
Earlier work this paper cites.
MapReduce: Simplified data processing on large clusters
Jeffrey Dean and Sanjay Ghemawat · 2004
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.
MapReduce: simplified data processing on large clusters
Jeffrey Dean and Sanjay Ghemawat · 2008
Earlier work this paper cites.
Terabyte sort on apache hadoop
Owen O’Malley · 2008
Earlier work this paper cites.
Graph mining on streams
Andrew McGregor · 2009
Earlier work this paper cites.
On distributing symmetric streaming computations
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, and Zoya Svitkina · 2010
Earlier work this paper cites.
A model of computation for mapreduce
Howard Karloff, Siddharth Suri, and Sergei Vassilvitskii · 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.
Fast clustering using MapReduce
Alina Ene, Sungjin Im, and Benjamin Moseley · 2011
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.
Powers of tensors and fast matrix multiplication
François Le Gall · 2014
Later among the works it cites.
Fast distributed algorithms for connectivity and mst in large graphs
Gopal Pandurangan, Peter Robinson, and Michele Scquizzato · 2016
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
Later among the works it cites.
Randomized composable coresets for matching and vertex cover
Sepehr Assadi and Sanjeev Khanna · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Communication steps for parallel query processing
Paul Beame, Paraschos Koutris, and Dan Suciu · 2013
Cited alongside, same era.
Finding connected components in map-reduce in logarithmic rounds
Vibhor Rastogi, Ashwin Machanavajjhala, Laukik Chitnis, and Anish Das Sarma · 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.
Connected components in mapreduce and beyond
Raimondas Kiveris, Silvio Lattanzi, Vahab Mirrokni, Vibhor Rastogi, and Sergei Vassilvitskii · 2014
Cited alongside, same era.
Efficient massively parallel methods for dynamic programming
Sungjin Im, Benjamin Moseley, and Xiaorui Sun · 2017
Later among the works it cites.
Access to data and number of iterations: Dual primal algorithms for maximum matching under resource constraints
Kook Jin Ahn and Sudipto Guha · 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.
Round compression for parallel matching algorithms
Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, and Piotr Sankowski · 2018
Closest in time.
Round- and message-optimal distributed graph algorithms
Bernhard Haeupler, D. Ellis Hershkowitz, and David Wajc · 2018
Closest in time.