46 citations · 313 across the 68 of their papers we have counts for
7 papers · 2 filters
Near Optimal Leader Election in Multi-Hop Radio Networks
Mohsen Ghaffari, Bernhard Haeupler
We present distributed randomized leader election protocols for multi-hop radio networks that elect a leader in almost the same time required for broadcasting a message. F…
Simple, Fast and Deterministic Gossip and Rumor Spreading
Bernhard Haeupler
We study gossip algorithms for the rumor spreading problem which asks each node to deliver a rumor to all nodes in an unknown network. Gossip algorithms allow nodes only to call on…
Lower Bounds on Information Dissemination in Dynamic Networks
Bernhard Haeupler, Fabian Kuhn
We study lower bounds on information dissemination in adversarial dynamic networks. Initially, k pieces of information (henceforth called tokens) are distributed among n nodes. The…
Bounds on Contention Management in Radio Networks
Mohsen Ghaffari, Bernhard Haeupler, Nancy Lynch +1
The local broadcast problem assumes that processes in a wireless network are provided messages, one by one, that must be delivered to their neighbors. In this paper, we prove tight…
Beeping a Maximal Independent Set
Yehuda Afek, Noga Alon, Ziv Bar-Joseph +3
We consider the problem of computing a maximal independent set (MIS) in an extremely harsh broadcast model that relies only on carrier sensing. The model consists of an anonymous b…
Tighter Worst-Case Bounds on Algebraic Gossip
Bernhard Haeupler
Gossip and in particular network coded algebraic gossip have recently attracted attention as a fast, bandwidth-efficient, reliable and distributed way to broadcast or multicast mul…