scientific article; zbMATH DE number 7376080

DOI10.4230/LIPIcs.ICALP.2018.153zbMath1499.68037arXiv1808.00838MaRDI QIDQ5002843

Ofer Grossman, Bernhard Haeupler, Sidhanth Mohanty

Publication date: 28 July 2021

Full work available at URL: https://arxiv.org/abs/1808.00838

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

error correctionerasuresdistributed computing with noisenoisy broadcast

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Finding OR in a noisy broadcast network
• Algebraic methods in the congested clique
• Brief Announcement
• A coding theorem for distributed computation
• On the power of the congested clique model
• Constant-Rate Coding for Multiparty Interactive Communication Is Impossible
• Finding parity in a simple broadcast network
• Lower Bounds for the Noisy Broadcast Problem
• Computing with Noisy Information
• Reliable Communication over Highly Connected Noisy Networks
• Class of constructive asymptotically good algebraic codes

This page was built for publication: