Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space

23 July 2018

Papers citing "Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space"

13 / 13 papers shown

Title
Improved Deterministic $(Δ+1)$ -Coloring in Low-Space MPC A. Czumaj Peter Davies M. Parter 56 21 0 10 Dec 2021
Deterministic Massively Parallel Connectivity Samantha R. Coy A. Czumaj 81 18 0 09 Aug 2021
Component Stability in Low-Space Massively Parallel Computation A. Czumaj Peter Davies M. Parter 61 24 0 03 Jun 2021
Massively Parallel Algorithms for Small Subgraph Counting Amartya Shankha Biswas T. Eden Quanquan C. Liu Slobodan Mitrović R. Rubinfeld 62 8 0 19 Feb 2020
Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model Krzysztof Nowicki Krzysztof Onak 56 11 0 18 Feb 2020
New lower bounds for Massively Parallel Computation from query complexity Moses Charikar Weiyun Ma Li-Yang Tan 39 1 0 05 Jan 2020
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space A. Czumaj Peter Davies M. Parter 83 29 0 11 Dec 2019
Improved Local Computation Algorithm for Set Cover via Sparsification Christoph Grunau Slobodan Mitrovic R. Rubinfeld A. Vakilian LRM 49 9 0 30 Oct 2019
Log Diameter Rounds Algorithms for $2$ -Vertex and $2$ -Edge Connectivity Alexandr Andoni C. Stein Peilin Zhong 32 19 0 02 May 2019
Exponentially Faster Massively Parallel Maximal Matching Soheil Behnezhad Mohammadtaghi Hajiaghayi David G. Harris 99 62 0 11 Jan 2019
Weighted Matchings via Unweighted Augmentations Buddhima Gamlath S. Kale Slobodan Mitrovic William Yang Wang 67 66 0 07 Nov 2018
Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs Sepehr Assadi Xiaorui Sun Omri Weinstein 54 58 0 08 May 2018
Round Compression for Parallel Matching Algorithms A. Czumaj Jakub Lacki Aleksander Madry Slobodan Mitrovic Krzysztof Onak Piotr Sankowski 85 101 0 11 Jul 2017