v1v2v3 (latest)

MST in O(1) Rounds of the Congested Clique

26 July 2017

Papers citing "MST in O(1) Rounds of the Congested Clique"

28 / 28 papers shown

Title
Distributed Symmetry Breaking on Power Graphs via Sparsification Yannic Maus Saku Peltonen Jara Uitto 63 11 0 14 Feb 2023
Fault-Tolerant Graph Realizations in the Congested Clique A. R. Molla Manish Kumar S. Sivasubramaniam 21 1 0 22 Aug 2022
Computing Power of Hybrid Models in Synchronous Networks Pierre Fraigniaud Pedro Montealegre Pablo Paredes I. Rapaport Martín Ríos-Wilson Ioan Todinca 55 2 0 04 Aug 2022
Improved Deterministic Connectivity in Massively Parallel Computation Manuela Fischer Jeff Giliberti Christoph Grunau 70 5 0 03 Jun 2022
Benchmarking Graphormer on Large-Scale Molecular Modeling Datasets Yu Shi Shuxin Zheng Guolin Ke Yifei Shen Jiacheng You Jiyan He Shengjie Luo Chang-Shu Liu Di He Tie-Yan Liu AI4CE 102 67 0 09 Mar 2022
Deterministic Massively Parallel Connectivity Samantha R. Coy A. Czumaj 81 18 0 09 Aug 2021
Low-Congestion Shortcuts in Constant Diameter Graphs Shimon Kogan M. Parter 28 11 0 03 Jun 2021
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching Naoki Kitamura Taisuke Izumi 60 5 0 25 Apr 2021
Time-Optimal Construction of Overlay Networks Thorsten Götte Kristian Hinnenthal Christian Scheideler Julian Werthmann 50 21 0 08 Sep 2020
Tight Distributed Sketching Lower Bound for Connectivity Huacheng Yu 56 8 0 24 Jul 2020
A Deterministic Algorithm for the MST Problem in Constant Rounds of Congested Clique Krzysztof Nowicki 53 36 0 09 Dec 2019
Distributed MST: A Smoothed Analysis Soumyottam Chatterjee Gopal Pandurangan N. Pham 50 10 0 06 Nov 2019
Shortest Paths in a Hybrid Network Model John E. Augustine Kristian Hinnenthal Fabian Kuhn Christian Scheideler P. Schneider 47 31 0 04 Sep 2019
Faster Algorithms for Edge Connectivity via Random $2$ -Out Contractions M. Ghaffari Krzysztof Nowicki M. Thorup 157 50 0 02 Sep 2019
Low-Congestion Shortcut and Graph Parameters Naoki Kitamura Hirotaka Kitagawa Y. Otachi Taisuke Izumi 37 9 0 26 Aug 2019
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model Taisuke Izumi F. Gall 33 35 0 06 Jun 2019
Connectivity Lower Bounds in Broadcast Congested Clique Shreyas Pai Sriram V. Pemmaraju 31 11 0 22 May 2019
Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms Lélia Blin Laurent Feuilloley Gabriel Le Bouder 85 4 0 21 May 2019
Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration Yi-Jun Chang Thatchaphol Saranurak 52 51 0 17 Apr 2019
Fast Approximate Shortest Paths in the Congested Clique K. Censor-Hillel Michal Dory Janne H. Korhonen Dean Leitersdorf 61 54 0 14 Mar 2019
Large-Scale Distributed Algorithms for Facility Location with Outliers Tanmay Inamdar Shreyas Pai Sriram V. Pemmaraju 24 7 0 15 Nov 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 42 18 0 17 Jul 2018
Distributed Triangle Detection via Expander Decomposition Yi-Jun Chang Seth Pettie Hengjie Zhang 56 47 0 17 Jul 2018
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover M. Ghaffari Themis Gouleakis Christian Konrad Slobodan Mitrovic R. Rubinfeld 97 132 0 22 Feb 2018
$MIS in the Congested Clique Model in $O(\log \log Δ)$ Rounds$ MIS in the Congested Clique Model in $O(\log \log Δ)$ Rounds C. Konrad 43 8 0 21 Feb 2018
Graph Reconstruction in the Congested Clique Pedro Montealegre Sebastian Perez-Salazar I. Rapaport Ioan Todinca 24 5 0 09 Jun 2017
On the Distributed Complexity of Large-Scale Graph Computations Gopal Pandurangan Peter Robinson Michele Scquizzato 86 53 0 26 Feb 2016