The wakeup problem in synchronous broadcast systems (extended abstract)
From MaRDI portal
Publication:5176777
DOI10.1145/343477.343529zbMath1314.68375OpenAlexW1992094452MaRDI QIDQ5176777
Andrzej Pelc, Leszek Gąsieniec, David Peleg
Publication date: 3 March 2015
Published in: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/343477.343529
Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Randomized algorithms (68W20) Distributed algorithms (68W15)
Related Items (2)
Coloring unstructured radio networks ⋮ Deterministic non-adaptive contention resolution on a shared channel
This page was built for publication: The wakeup problem in synchronous broadcast systems (extended abstract)