Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs

8 May 2018

Papers citing "Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs"

26 / 26 papers shown

Title
Fast Dynamic Programming in Trees in the MPC ModelACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2023 Chetan Gupta R. Latypov Yannic Maus Shreyas Pai Simo Särkkä Jan Studený Jukka Suomela Jara Uitto Hossein Vahidi 128 5 0 05 May 2023
Improved Deterministic Connectivity in Massively Parallel ComputationInternational Symposium on Distributed Computing (DISC), 2022 Manuela Fischer Jeff Giliberti Christoph Grunau 145 5 0 03 Jun 2022
Improved Deterministic $(Δ+1)$ -Coloring in Low-Space MPC A. Czumaj Peter Davies M. Parter 133 21 0 10 Dec 2021
Efficient and Local Parallel Random Walks Michael Kapralov Silvio Lattanzi Navid Nouri Jakab Tardos 110 3 0 01 Dec 2021
Adaptive Massively Parallel Constant-round Tree ContractionInformation Technology Convergence and Services (ITCS), 2021 Mohammadtaghi Hajiaghayi Marina Knittel Hamed Saleh Hsin-Hao Su 97 3 0 02 Nov 2021
Deterministic Massively Parallel ConnectivitySymposium on the Theory of Computing (STOC), 2021 Samantha R. Coy A. Czumaj 179 20 0 09 Aug 2021
Sample-and-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC ModelFoundations of Software Technology and Theoretical Computer Science (FSTTCS), 2020 Kishore Kothapalli Shreyas Pai Sriram V. Pemmaraju 167 8 0 26 Sep 2020
Time-Optimal Construction of Overlay NetworksDistributed computing (Distrib. Comput.), 2020 Thorsten Götte Kristian Hinnenthal Christian Scheideler Julian Werthmann 148 24 0 08 Sep 2020
Massively Parallel Algorithms for Distance Approximation and SpannersACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2020 Amartya Shankha Biswas Michal Dory M. Ghaffari Slobodan Mitrović Yasamin Nazari 258 20 0 02 Mar 2020
Connected Components on a PRAM in Log Diameter TimeACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2020 S. Liu R. Tarjan Peilin Zhong 219 9 0 02 Mar 2020
Massively Parallel Algorithms for Small Subgraph CountingInternational Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), 2020 Amartya Shankha Biswas T. Eden Quanquan C. Liu Slobodan Mitrović R. Rubinfeld 236 9 0 19 Feb 2020
How fast can you update your MST? (Dynamic algorithms for cluster computing) Seth Gilbert L. Li 150 5 0 17 Feb 2020
Parallel Batch-dynamic Trees via Change Propagation Umut A. Acar Daniel Anderson G. Blelloch Laxman Dhulipala Sam Westrick 167 2 0 12 Feb 2020
Equivalence Classes and Conditional Hardness in Massively Parallel ComputationsDistributed computing (Distrib. Comput.), 2020 Danupon Nanongkai Michele Scquizzato 210 18 0 07 Jan 2020
New lower bounds for Massively Parallel Computation from query complexity Moses Charikar Weiyun Ma Li-Yang Tan 141 1 0 05 Jan 2020
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space A. Czumaj Peter Davies M. Parter 202 32 0 11 Dec 2019
Near-Optimal Massively Parallel Graph ConnectivityIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2019 Soheil Behnezhad Laxman Dhulipala Hossein Esfandiari Jakub Lacki Vahab Mirrokni 181 54 0 11 Oct 2019
Faster Algorithms for Edge Connectivity via Random $2$ -Out ContractionsACM-SIAM Symposium on Discrete Algorithms (SODA), 2019 M. Ghaffari Krzysztof Nowicki M. Thorup 228 55 0 02 Sep 2019
Massively Parallel Computation via Remote Memory AccessACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2019 Soheil Behnezhad Laxman Dhulipala Hossein Esfandiari Jakub Lacki W. Schudy Vahab Mirrokni 207 30 0 18 May 2019
Log Diameter Rounds Algorithms for $2$ -Vertex and $2$ -Edge ConnectivityInternational Colloquium on Automata, Languages and Programming (ICALP), 2019 Alexandr Andoni C. Stein Peilin Zhong 103 20 0 02 May 2019
Exponentially Faster Massively Parallel Maximal Matching Soheil Behnezhad Mohammadtaghi Hajiaghayi David G. Harris 325 64 0 11 Jan 2019
Weighted Matchings via Unweighted AugmentationsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2018 Buddhima Gamlath S. Kale Slobodan Mitrovic William Yang Wang 148 70 0 07 Nov 2018
Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space Krzysztof Onak 142 32 0 23 Jul 2018
Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching Soheil Behnezhad Mahsa Derakhshan Mohammadtaghi Hajiaghayi R. Karp 140 18 0 17 Jul 2018
Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local ComputationACM-SIAM Symposium on Discrete Algorithms (SODA), 2018 M. Ghaffari Jara Uitto 149 107 0 17 Jul 2018
Parallel Graph Connectivity in Log Diameter Rounds Alexandr Andoni C. Stein Zhao Song Zhengyu Wang Peilin Zhong 161 104 0 08 May 2018