Sample-and-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model

26 September 2020

Papers citing "Sample-and-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model"

8 / 8 papers shown

Title
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond M. Ghaffari Christoph Grunau Ce Jin 47 30 0 22 Feb 2020
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space A. Czumaj Peter Davies M. Parter 62 29 0 11 Dec 2019
Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators Alexandr Andoni C. Stein Peilin Zhong 32 56 0 05 Nov 2019
Large-Scale Distributed Algorithms for Facility Location with Outliers Tanmay Inamdar Shreyas Pai Sriram V. Pemmaraju 6 7 0 15 Nov 2018
Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs Sepehr Assadi Xiaorui Sun Omri Weinstein 47 58 0 08 May 2018
Near-Constant-Time Distributed Algorithms on a Congested Clique James Hegeman Sriram V. Pemmaraju Vivek Sardeshmukh 71 58 0 09 Aug 2014
The Locality of Distributed Symmetry Breaking Leonid Barenboim Michael Elkin Seth Pettie Johannes Schneider 85 298 0 09 Feb 2012
Sorting, Searching, and Simulation in the MapReduce Framework M. Goodrich Nodari Sitchinava Qin Zhang 90 250 0 10 Jan 2011