A Near-Optimal Deterministic Distributed Synchronizer

DOI10.1145/3583668.3594598arXiv2305.06452OpenAlexW4380874660WikidataQ130806422 ScholiaQ130806422MaRDI QIDQ6202244

Unnamed Author, Mohsen Ghaffari

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/2305.06452

zbMATH Keywords

distributed algorithmssynchronizerasynchronous algorithms

Mathematics Subject Classification ID

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

Cites Work

• Low diameter graph decompositions
• Complexity of network synchronization
• Locality in Distributed Graph Algorithms
• Distributed Computing: A Locality-Sensitive Approach
• Polylogarithmic-time deterministic network decomposition and distributed derandomization
• Distributed MST and Routing in Almost Mixing Time

This page was built for publication: A Near-Optimal Deterministic Distributed Synchronizer