v1v2 (latest)

Round Compression for Parallel Matching Algorithms

11 July 2017

Papers citing "Round Compression for Parallel Matching Algorithms"

31 / 31 papers shown

Title
Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs Yi-Jun Chang Danling Zheng 84 1 0 15 Apr 2023
Adaptive Massively Parallel Connectivity in Optimal Space R. Latypov J. Łącki Yannic Maus Jara Uitto 52 0 0 08 Feb 2023
Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs Manuela Fischer Jeff Giliberti Christoph Grunau 66 5 0 26 Jan 2023
Massively Parallel Algorithms for $b$ -Matching M. Ghaffari Christoph Grunau Slobodan Mitrovic FedML 41 7 0 14 Nov 2022
Almost 3-Approximate Correlation Clustering in Constant Rounds Soheil Behnezhad Moses Charikar Weiyun Ma Li-Yang Tan 57 28 0 07 May 2022
Deterministic Massively Parallel Connectivity Samantha R. Coy A. Czumaj 81 18 0 09 Aug 2021
Correlation Clustering in Constant Many Parallel Rounds Vincent Cohen-Addad Silvio Lattanzi Slobodan Mitrović A. Norouzi-Fard Nikos Parotsidis Jakub Tarnawski 44 43 0 15 Jun 2021
Component Stability in Low-Space Massively Parallel Computation A. Czumaj Peter Davies M. Parter 58 24 0 03 Jun 2021
Massively Parallel Correlation Clustering in Bounded Arboricity Graphs Mélanie Cambus Davin Choo Havu Miikonen Jara Uitto 47 15 0 23 Feb 2021
Massively Parallel Algorithms for Distance Approximation and Spanners Amartya Shankha Biswas Michal Dory M. Ghaffari Slobodan Mitrović Yasamin Nazari 61 20 0 02 Mar 2020
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond M. Ghaffari Christoph Grunau Ce Jin 60 30 0 22 Feb 2020
Distributed Maximum Matching Verification in CONGEST Mohamad Ahmadi Fabian Kuhn 62 7 0 18 Feb 2020
Equivalence Classes and Conditional Hardness in Massively Parallel Computations Danupon Nanongkai Michele Scquizzato 61 18 0 07 Jan 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
String Matching with Wildcards in the Massively Parallel Computation Model Mohammadtaghi Hajiaghayi Hamed Saleh Saeed Seddighin Xiaorui Sun 62 11 0 25 Oct 2019
Near-Optimal Massively Parallel Graph Connectivity Soheil Behnezhad Laxman Dhulipala Hossein Esfandiari Jakub Lacki Vahab Mirrokni 67 52 0 11 Oct 2019
Faster Algorithms for Edge Connectivity via Random $2$ -Out Contractions M. Ghaffari Krzysztof Nowicki M. Thorup 157 50 0 02 Sep 2019
Distributed Weighted Matching via Randomized Composable Coresets Sepehr Assadi M. Bateni Vahab Mirrokni 42 8 0 05 Jun 2019
Dynamic Algorithms for the Massively Parallel Computation Model G. Italiano Silvio Lattanzi Vahab S. Mirrokni Nikos Parotsidis 33 26 0 22 May 2019
Exponentially Faster Massively Parallel Maximal Matching Soheil Behnezhad Mohammadtaghi Hajiaghayi David G. Harris 92 62 0 11 Jan 2019
Weighted Matchings via Unweighted Augmentations Buddhima Gamlath S. Kale Slobodan Mitrovic William Yang Wang 61 66 0 07 Nov 2018
Connected Components at Scale via Local Contractions Jakub Lacki Vahab Mirrokni Michał Włodarczyk 68 18 0 27 Jul 2018
Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space Krzysztof Onak 62 30 0 23 Jul 2018
Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching Soheil Behnezhad Mahsa Derakhshan Mohammadtaghi Hajiaghayi R. Karp 49 18 0 17 Jul 2018
Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation M. Ghaffari Jara Uitto 58 103 0 17 Jul 2018
Parallel Graph Connectivity in Log Diameter Rounds Alexandr Andoni C. Stein Zhao Song Zhengyu Wang Peilin Zhong 55 99 0 08 May 2018
Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs Sepehr Assadi Xiaorui Sun Omri Weinstein 54 58 0 08 May 2018
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover M. Ghaffari Themis Gouleakis Christian Konrad Slobodan Mitrovic R. Rubinfeld 98 132 0 22 Feb 2018
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs Sepehr Assadi M. Bateni A. Bernstein Vahab Mirrokni Cliff Stein 58 124 0 08 Nov 2017
Simple Round Compression for Parallel Vertex Cover Sepehr Assadi 43 30 0 14 Sep 2017