A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space
[article]
2020
arXiv
pre-print
The Massively Parallel Computation (MPC) model is an emerging model which distills core aspects of distributed and parallel computation. It has been developed as a tool to solve (typically graph) problems in systems where the input is distributed over many machines with limited space. Recent work has focused on the regime in which machines have sublinear (in n, the number of nodes in the input graph) memory, with randomized algorithms presented for fundamental graph problems of Maximal Matching
arXiv:1912.05390v3
fatcat:oj2d5kzlhndebhd2ydvwx2q6la