Artur Czumaj
Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC
Czumaj, Artur; Davies, Peter; Parter, Merav
Citation
Czumaj, A., Davies, P., & Parter, M. (2021). Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC. SIAM Journal on Computing, 50(5), 1603-1626. https://doi.org/10.1137/20m1366502
| Journal Article Type | Article |
|---|---|
| Acceptance Date | Oct 1, 2020 |
| Online Publication Date | Oct 25, 2021 |
| Publication Date | 2021-01 |
| Deposit Date | Jan 10, 2025 |
| Journal | SIAM Journal on Computing |
| Print ISSN | 0097-5397 |
| Electronic ISSN | 1095-7111 |
| Publisher | Society for Industrial and Applied Mathematics |
| Peer Reviewed | Peer Reviewed |
| Volume | 50 |
| Issue | 5 |
| Pages | 1603-1626 |
| DOI | https://doi.org/10.1137/20m1366502 |
| Public URL | https://durham-repository.worktribe.com/output/3329386 |
| Other Repo URL | https://wrap.warwick.ac.uk/id/eprint/139227/ |
You might also like
Component stability in low-space massively parallel computation
(2024)
Journal Article
Optimal (degree+1)-Coloring in Congested Clique
(2023)
Presentation / Conference Contribution
Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization
(2023)
Presentation / Conference Contribution
Improved Distributed Algorithms for the Lovász Local Lemma and Edge Coloring
(2023)
Presentation / Conference Contribution
Optimal Message-Passing with Noisy Beeps
(2023)
Presentation / Conference Contribution