Mohsen Ghaffari and Merav Parter: Minimum Spanning Tree in Log-Star Rounds of Congested Clique

We present a randomized distributed algorithm that computes the minimum spanning tree in O(log^* n) rounds, in the congested clique model. This improves on the O(log log n) round algorithm of Lotker et al. [SPAA 2003; SICOMP 2005] and the O(log log log n) round algorithm of Hegeman et al. [PODC 15].