Brief Announcement: What Can We Compute in a Single Round of the Congested Clique?

DOI10.1145/3583668.3594575arXiv2210.02638OpenAlexW4380874718MaRDI QIDQ6202240

No author found.

Publication date: 26 March 2024

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

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

zbMATH Keywords

lower boundcongested cliquedistributed graph algorithm

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Graph reconstruction in the congested clique
• Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication
• Toward Optimal Bounds in the Congested Clique
• On the power of the congested clique model
• A trade-off between information and communication in broadcast protocols
• Optimal deterministic routing and sorting on the congested clique
• Congested Clique Algorithms for the Minimum Cut Problem
• MST in Log-Star Rounds of Congested Clique
• Triangle Finding and Listing in CONGEST Networks
• A deterministic algorithm for the MST problem in constant rounds of congested clique

This page was built for publication: Brief Announcement: What Can We Compute in a Single Round of the Congested Clique?