We study the effect of noise on the n-party beeping model. In this model, in every round,
each party may decide to either'beep'or not. All parties hear a beep if and only if at least one …

We address fully-defective asynchronous networks, in which all links are subject to an
unlimited number of alteration errors, implying that all messages in the network may be …

Single-hop radio networks (SHRN) are a well studied abstraction of communication over a
wireless channel. In this model, in every round, each of the n participating parties may …

The field of Interactive Coding studies how an interactive protocol can be made resilient to
channel errors. Even though this field has received abundant attention since Schulman's …

Interactive coding allows two or more parties to carry out a distributed computation over a
communication network that may be noisy. The ultimate goal is to develop efficient coding …

Beeping networks consist of exceedingly simple computational devices whose
communication is based on beeps and silence. In this work, we introduce noisy beeping …

We introduce noisy beeping networks, where nodes have limited communication
capabilities, namely, they can only emit energy or sense the channel for energy …

In the field of interactive coding, two or more parties wish to carry out a distributed
computation over a communication network that may be noisy. The ultimate goal is to …

We consider computations over networks with multiple broadcast channels that intersect at a
single party. Each broadcast link suffers from random bit-flip noise that affects the receivers …

We revisit the problem of low-memory robust simulation of interactive protocols over noisy
channels. Haeupler [FOCS 2014] considered robust simulation of two-party interactive …