Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets
Practice

Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice

24 September 2020

Soheil Behnezhad

Laxman Dhulipala

Hossein Esfandiari

Vahab Mirrokni

ArXiv (abs)PDF HTML

Papers citing "Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice"

7 / 7 papers shown

Title
Engineering Massively Parallel MST Algorithms Peter Sanders Matthias Schimek 55 4 0 23 Feb 2023
Adaptive Massively Parallel Connectivity in Optimal Space R. Latypov J. Łącki Yannic Maus Jara Uitto 57 0 0 08 Feb 2023
Plume: Differential Privacy at Scale Kareem Amin Jennifer Gillenwater Matthew Joseph Alex Kulesza Sergei Vassilvitskii 61 9 0 27 Jan 2022
Adaptive Massively Parallel Constant-round Tree Contraction Mohammadtaghi Hajiaghayi Marina Knittel Hamed Saleh Hsin-Hao Su 23 3 0 02 Nov 2021
Time-Optimal Sublinear Algorithms for Matching and Vertex Cover Soheil Behnezhad 38 32 0 05 Jun 2021
ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms Laxman Dhulipala Changwan Hong Julian Shun GNN 70 36 0 10 Aug 2020
Equivalence Classes and Conditional Hardness in Massively Parallel Computations Danupon Nanongkai Michele Scquizzato 63 18 0 07 Jan 2020