The do-all problem in broadcast networks

DOI10.1145/383962.384000MaRDI QIDQ2787672zbMATH OpenOpenAlexFDO

Authors Bogdan S. Chlebus, Dariusz R. Kowalski, 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

adversarydistributed algorithmfail-stop failuresindependent taskslower boundmultiple-access channel

Mathematics Subject Classification ID

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

Recommendations

• The Network Packing Problem in Terrestrial Broadcasting
• On the number of broadcast schemes in networks
• Approximating All-to-All Broadcast in Wireless Networks
• Approximation algorithms for channel allocation problems in broadcast networks
• Approximation algorithms for channel allocation problems in broadcast networks
• All-to-all broadcast problem of some classes of graphs under the half duplex all-port model
• Representations of the multicast network problem
• scientific article; zbMATH DE number 6469246
• All-to-all broadcast problems on Cartesian product graphs

Cited in

(5)

• Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks
• The complexity of finding a broadcast center
• Performing work with asynchronous processors: Message-delay-sensitive bounds
• scientific article; zbMATH DE number 1979510 (Why is no real title available?)
• Randomization helps to perform independent tasks reliably

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2787672)