Connectivity Lower Bounds in Broadcast Congested Clique

DOI10.1145/3293611.3331569OpenAlexW2962883508MaRDI QIDQ5145216

Shreyas Pai, Sriram V. Pemmaraju

Publication date: 20 January 2021

Published in: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.09016

zbMATH Keywords

connectivitylower boundsinformation theorycommunication complexityset partitionbroadcast congested clique

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (2)

The role of randomness in the broadcast congested clique model ⋮ Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE

This page was built for publication: Connectivity Lower Bounds in Broadcast Congested Clique