A Deterministic Algorithm for the MST Problem in Constant Rounds of
Congested Clique

v1v2v3 (latest)

A Deterministic Algorithm for the MST Problem in Constant Rounds of Congested Clique

9 December 2019

Krzysztof Nowicki

ArXiv (abs)PDF HTML

Papers citing "A Deterministic Algorithm for the MST Problem in Constant Rounds of Congested Clique"

19 / 19 papers shown

Title
Massively Parallel Algorithms for Approximate Shortest Paths Michal Dory Shaked Matar 99 1 0 09 Dec 2024
Sublinear-time Sampling of Spanning Trees in the Congested Clique Sriram V. Pemmaraju Sourya Roy Joshua Sobel 69 0 0 20 Nov 2024
Massively Parallel Ruling Set Made Deterministic Jeff Giliberti Zahra Parsaeian 86 4 0 18 Jun 2024
Boolean Matrix Multiplication for Highly Clustered Data on the Congested Clique Andrzej Lingas 60 1 0 25 May 2024
$A Note on Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds of the Congested Clique$ A Note on Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds of the Congested Clique Andrzej Lingas 56 0 0 24 May 2024
Classical and Quantum Distributed Algorithms for the Survivable Network Design Problem Phillip A. Kerger D. E. B. Neira Zoe Gonzalez Izquierdo E. Rieffel 90 0 0 16 Apr 2024
Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem Mélanie Cambus Fabian Kuhn Shreyas Pai Jara Uitto 70 10 0 01 Jun 2023
Convex Hulls, Triangulations, and Voronoi Diagrams of Planar Point Sets on the Congested Clique J. Jansson C. Levcopoulos A. Lingas Valentin Polishchuk 98 0 0 17 May 2023
$Mind the $\tilde{\mathcal{O}}$: Asymptotically Better, but Still Impractical, Quantum Distributed Algorithms$ Mind the $\tilde{\mathcal{O}}$ : Asymptotically Better, but Still Impractical, Quantum Distributed Algorithms Phillip A. Kerger D. E. B. Neira Zoe Gonzalez Izquierdo E. Rieffel 72 0 0 06 Apr 2023
Distributed Symmetry Breaking on Power Graphs via Sparsification Yannic Maus Saku Peltonen Jara Uitto 63 11 0 14 Feb 2023
What Can We Compute in a Single Round of the Congested Clique? Peter Robinson 56 4 0 06 Oct 2022
Improved Deterministic Connectivity in Massively Parallel Computation Manuela Fischer Jeff Giliberti Christoph Grunau 70 5 0 03 Jun 2022
A New Model for Massively Parallel Computation Considering both Communication and IO Cost Hengzhao Ma Xiangyu Gao Jianzhong Li Tian-Hui Gao 28 0 0 24 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
Near-Optimal Scheduling in the Congested Clique K. Censor-Hillel Yannic Maus Volodymyr Polosukhin 25 1 0 14 Feb 2021
Time-Optimal Construction of Overlay Networks Thorsten Götte Kristian Hinnenthal Christian Scheideler Julian Werthmann 50 21 0 08 Sep 2020
Input-Dynamic Distributed Algorithms for Communication Networks Klaus-Tycho Foerster Janne H. Korhonen A. Paz Joel Rybicki Stefan Schmid 41 3 0 15 May 2020
Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model Krzysztof Nowicki Krzysztof Onak 42 11 0 18 Feb 2020