Simple, Deterministic, Constant-Round Coloring in the Congested Clique

DOI10.1145/3382734.3405751OpenAlexW3104611438MaRDI QIDQ5855250

Peter Davies, Merav Parter, Artur Czumaj

Publication date: 15 March 2021

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

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

zbMATH Keywords

coloringderandomizationmassively parallel computationcongested clique

Mathematics Subject Classification ID

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

Related Items (2)

Deterministic Massively Parallel Connectivity ⋮ Near-optimal scheduling in the congested clique

This page was built for publication: Simple, Deterministic, Constant-Round Coloring in the Congested Clique