The do-all problem in broadcast networks

DOI10.1145/383962.384000zbMath1333.68051OpenAlexW2016201384MaRDI 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

zbMATH Keywords

lower bounddistributed algorithmmultiple-access channelindependent tasksadversaryfail-stop failures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (3)

Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks ⋮ Randomization helps to perform independent tasks reliably ⋮ Performing work with asynchronous processors: Message-delay-sensitive bounds

This page was built for publication: The do-all problem in broadcast networks