Parallel Graph Connectivity in Log Diameter Rounds

8 May 2018

Papers citing "Parallel Graph Connectivity in Log Diameter Rounds"

43 / 43 papers shown

Title
Positional Attention: Expressivity and Learnability of Algorithmic Computation George Giapitzakis Artur Back de Luca Shenghao Yang Petar Veličković Kimon Fountoulakis 430 0 0 02 Oct 2024
Understanding Transformer Reasoning Capabilities via Graph Algorithms Clayton Sanford Bahare Fatemi Ethan Hall Anton Tsitsulin Seyed Mehran Kazemi Jonathan J. Halcrow Bryan Perozzi Vahab Mirrokni 248 64 0 28 May 2024
Massively-Parallel Heat Map Sorting and Applications To Explainable Clustering Sepideh Aghamolaei Mohammad Ghodsi 147 0 0 14 Sep 2023
Massively Parallel Algorithms for the Stochastic Block ModelEmbedded Systems and Applications (ESA), 2023 Zelin Li Pan Peng Xianbin Zhu 147 1 0 02 Jul 2023
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
Fully Scalable Massively Parallel Algorithms for Embedded Planar GraphsACM-SIAM Symposium on Discrete Algorithms (SODA), 2023 Yi-Jun Chang Danling Zheng 213 1 0 15 Apr 2023
Parallel Strong Connectivity Based on Faster Reachability Letong Wang Xiaojun Dong Yan Gu Yihan Sun 179 23 0 08 Mar 2023
Massively Parallel Computation in a Heterogeneous RegimeACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022 Orr Fischer A. Horowitz R. Oshman 131 2 0 28 Feb 2023
Engineering Massively Parallel MST AlgorithmsIEEE International Parallel and Distributed Processing Symposium (IPDPS), 2023 Peter Sanders Matthias Schimek 197 4 0 23 Feb 2023
Adaptive Massively Parallel Connectivity in Optimal SpaceACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2023 R. Latypov J. Łącki Yannic Maus Jara Uitto 197 0 0 08 Feb 2023
Optimal Deterministic Massively Parallel Connectivity on ForestsACM-SIAM Symposium on Discrete Algorithms (SODA), 2022 Alkida Balliu R. Latypov Yannic Maus Dennis Olivetti Jara Uitto 162 6 0 07 Nov 2022
Scalable Differentially Private Clustering via Hierarchically Separated TreesKnowledge Discovery and Data Mining (KDD), 2022 Vincent Cohen-Addad Alessandro Epasto Silvio Lattanzi Vahab Mirrokni Andrés Muñoz David Saulpic Chris Schwiegelshohn Sergei Vassilvitskii FedML 106 22 0 17 Jun 2022
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
Almost 3-Approximate Correlation Clustering in Constant RoundsIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2022 Soheil Behnezhad Moses Charikar Weiyun Ma Li-Yang Tan 137 31 0 07 May 2022
Adaptive Massively Parallel Constant-round Tree ContractionInformation Technology Convergence and Services (ITCS), 2021 Mohammadtaghi Hajiaghayi Marina Knittel Hamed Saleh Hsin-Hao Su 89 3 0 02 Nov 2021
Deterministic Massively Parallel ConnectivitySymposium on the Theory of Computing (STOC), 2021 Samantha R. Coy A. Czumaj 163 20 0 09 Aug 2021
Component Stability in Low-Space Massively Parallel ComputationACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2021 A. Czumaj Peter Davies M. Parter 132 26 0 03 Jun 2021
Massively Parallel Correlation Clustering in Bounded Arboricity GraphsInternational Symposium on Distributed Computing (DISC), 2021 Mélanie Cambus Davin Choo Havu Miikonen Jara Uitto 172 14 0 23 Feb 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 147 8 0 26 Sep 2020
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets PracticeProceedings of the VLDB Endowment (PVLDB), 2020 Soheil Behnezhad Laxman Dhulipala Hossein Esfandiari Jakub Lacki Vahab Mirrokni W. Schudy 109 13 0 24 Sep 2020
Exploring the Design Space of Static and Incremental Graph Connectivity Algorithms on GPUsInternational Conference on Parallel Architectures and Compilation Techniques (PACT), 2020 Changwan Hong Laxman Dhulipala Julian Shun 3DV GNN 141 13 0 26 Aug 2020
ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity AlgorithmsProceedings of the VLDB Endowment (PVLDB), 2020 Laxman Dhulipala Changwan Hong Julian Shun GNN 212 37 0 10 Aug 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 234 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 211 9 0 02 Mar 2020
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and BeyondInternational Symposium on Distributed Computing (DISC), 2020 M. Ghaffari Christoph Grunau Ce Jin 179 31 0 22 Feb 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 228 9 0 19 Feb 2020
Equivalence Classes and Conditional Hardness in Massively Parallel ComputationsDistributed computing (Distrib. Comput.), 2020 Danupon Nanongkai Michele Scquizzato 198 18 0 07 Jan 2020
New lower bounds for Massively Parallel Computation from query complexity Moses Charikar Weiyun Ma Li-Yang Tan 129 1 0 05 Jan 2020
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space A. Czumaj Peter Davies M. Parter 174 32 0 11 Dec 2019
Parallel Approximate Undirected Shortest Paths Via Low Hop EmulatorsSymposium on the Theory of Computing (STOC), 2019 Alexandr Andoni C. Stein Peilin Zhong 110 60 0 05 Nov 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 177 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
Dynamic Algorithms for the Massively Parallel Computation ModelACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2019 G. Italiano Silvio Lattanzi Vahab S. Mirrokni Nikos Parotsidis 99 27 0 22 May 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 199 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 87 20 0 02 May 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 128 70 0 07 Nov 2018
Massively Parallel Approximate Distance Sketches M. Dinitz Yasamin Nazari 201 1 0 21 Oct 2018
Graph connectivity in log steps using label propagation Paul Burkhardt 365 2 0 20 Aug 2018
Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space Krzysztof Onak 138 32 0 23 Jul 2018
Random Sampling Applied to the MST Problem in the Node Congested Clique Model Krzysztof Nowicki 106 3 0 23 Jul 2018
Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching Soheil Behnezhad Mahsa Derakhshan Mohammadtaghi Hajiaghayi R. Karp 132 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 141 107 0 17 Jul 2018
Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs Sepehr Assadi Xiaorui Sun Omri Weinstein 161 59 0 08 May 2018