Finding OR in a noisy broadcast network

DOI10.1016/S0020-0190(00)00002-8MaRDI QIDQ294723zbMATH OpenFDO

Authors Joe Kilian, Uriel Feige

Publication date 16 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019000000028?np=y

zbMATH Keywords

agreementdistributed algorithmsnoisy computation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Distributed algorithms (68W15)

Recommendations

• Computation in Noisy Radio Networks
• scientific article; zbMATH DE number 1303562
• Algorithms for noisy broadcast with erasures
• Lower Bounds for the Noisy Broadcast Problem
• Computing in fault tolerant broadcast networks and noisy decision trees

Cites work

• Finding parity in a simple broadcast network
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1303562 (Why is no real title available?)

Cited in

(5)

• The complexity of finding a broadcast center
• Computing in fault tolerant broadcast networks and noisy decision trees
• Algorithms for noisy broadcast with erasures
• Information dissemination via broadcasts in the presence of adversarial noise
• Computation over the noisy broadcast channel with malicious parties

This page was built for publication: Finding OR in a noisy broadcast network

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