Beeping models are models for networks of weak devices, such as sensor networks or
biological networks. In these networks, nodes are allowed to communicate only via emitting …

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 …

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 …

In this paper, we consider contention resolution algorithms that are augmented with
predictions about the network. We begin by studying the natural setup in which the algorithm …

We revisit the fundamental question of information exchange between n parties connected
by a noisy binary broadcast channel, where the noise affects the transmitter (EI-Gamal …

Let II be a protocol over the n-party broadcast channel, where in each round, a pre-specified
party broadcasts a symbol to all other parties. We wish to design a scheme that takes such a …

In content-oblivious computation, n nodes wish to compute a given task over an
asynchronous network that suffers from an extremely harsh type of noise, which corrupts the …

Labeling schemes are a prevalent paradigm in various computing settings. In such
schemes, an oracle is given an input graph and produces a label for each of its nodes …

Constructing a shortest path between two network nodes is a fundamental task in distributed
computing. This work develops schemes for the construction of shortest paths in randomized …

Any interactive protocol between a pair of parties can be reliably simulated in the presence
of noise with a multiplicative overhead on the number of rounds (Schulman 1996). The …