The do-all problem in broadcast networks
From MaRDI portal
Publication:2787672
DOI10.1145/383962.384000zbMath1333.68051MaRDI QIDQ2787672
Dariusz R. Kowalski, Bogdan S. Chlebus, Andrzej Lingas
Publication date: 4 March 2016
Published in: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/383962.384000
lower bound; distributed algorithm; multiple-access channel; independent tasks; adversary; fail-stop failures
68Q25: Analysis of algorithms and problem complexity
68M14: Distributed systems
68W15: Distributed algorithms
Related Items
Randomization helps to perform independent tasks reliably, Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks, Performing work with asynchronous processors: Message-delay-sensitive bounds