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 …

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 …

We consider the celebrated radio network model for abstracting communication in wireless
networks. In this model, in any round, each node in the network may broadcast a message to …

We analyze resilient protocols over noisy networks, focusing on the interesting setting where
n computing parties (clients) are supported by a set of k assisting servers. All communication …

We develop techniques to prove lower bounds for the BCAST (log n) Broadcast Congested
Clique model (a distributed message passing model where in each round, each processor …

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 …

Over the last decades, the world has become increasingly more information-centric and
massive amounts of data, potentially distributed between many different sources, are being …

Since its introduction in Yao's seminal paper [Yao79], communication complexity has
revolutionized theoretical computer science. Indeed, not only has communication complexity …