Computing in fault tolerant broadcast networks and noisy decision trees

DOI10.1002/rsa.20240zbMath1208.68054OpenAlexW4244316901MaRDI QIDQ3055759

Ilan Newman

Publication date: 9 November 2010

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20240

zbMATH Keywords

fault tolerant computationsGallager's broadcast problemnoisy decision trees

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)

Related Items (2)

Skyline Computation with Noisy Comparisons ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding OR in a noisy broadcast network
• Reliable computation with cellular automata
• A coding theorem for distributed computation
• Coding for interactive communication
• Finding parity in a simple broadcast network
• On boolean decision trees with faulty nodes
• Computing with Noisy Information
• Computation in Noisy Radio Networks
• Reliable Information Storage in Memories Designed from Unreliable Components*
• Class of constructive asymptotically good algebraic codes

This page was built for publication: Computing in fault tolerant broadcast networks and noisy decision trees