Finding OR in a noisy broadcast network

DOI10.1016/S0020-0190(00)00002-8zbMATH Open1339.68016MaRDI QIDQ294723FDOQ294723

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

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

zbMATH Keywords

agreementdistributed algorithmsnoisy computation

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Finding parity in a simple broadcast network
• Title not available (Why is that?)

Cited In (3)

• Computing in fault tolerant broadcast networks and noisy decision trees
• Algorithms for noisy broadcast with erasures
• The complexity of finding a broadcast center

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)