Title: Efficient communication in radio networks" Speaker: Leszek A. Gasieniec, U of Liverpool Abstract: The two most fundamental problems in relation to information dissemination are broadcasting, one-to-all communication, and gossiping, total information exchange. In broadcasting, the goal is to distribute a specific piece of information "broadcast message" from a distinguished source node to all other nodes in the network. In gossiping, however, each node in the network is expected to distribute its own message to every other node in the network. A lot of attention has been given to the broadcasting problem that resulted in a large volume of efficient algorithmic solutions in the models described above. However, much less is known about gossiping. This presentation is a short survey on the most important developments in efficient radio broadcasting and gossiping. We discuss deterministic as well as randomized methods of communication in the context of a variety of models taking into account knowledge in relation to the network size and topology, orientation of connections and the upper bound on the size of messages. Using this opportunity we also shed more light on several combinatorial structures and algorithmic solutions that emerged during studies on efficient radio broadcasting and gossiping.