activity
20102026
most citedLeader Election for Anonymous Asynchronous Agents in Arbitrary Networks

25 citations · 126 across the 37 of their papers we have counts for

collaborators
Showing 2015Show all

6 papers · 1 filter

cs.DC2015★ 2 cited

Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC

Kokouvi Hounkanli, Avery Miller, Andrzej Pelc

Consensus is one of the fundamental tasks studied in distributed computing. Processors have input values from some set and they have to decide the same value from this set. If…

cs.DC2015

Time Versus Cost Tradeoffs for Deterministic Rendezvous in Networks

Avery Miller, Andrzej Pelc

Two mobile agents, starting from different nodes of a network at possibly different times, have to meet at the same node. This problem is known as . Agents mov…

cs.DC2015

Knowledge, Level of Symmetry, and Time of Leader Election

Emanuele G. Fusco, Andrzej Pelc

We study the time needed for deterministic leader election in the model, where in every round a node can exchange any messages with its neighbors and perform any loc…

cs.DC2015

Deterministic Broadcasting and Gossiping with Beeps

Kokouvi Hounkanli, Andrzej Pelc

Broadcasting and gossiping are fundamental communication tasks in networks. In broadcasting,one node of a network has a message that must be learned by all other nodes. In gossipin…

cs.DC2015

Tradeoffs Between Cost and Information for Rendezvous and Treasure Hunt

Avery Miller, Andrzej Pelc

In rendezvous, two agents traverse network edges in synchronous rounds and have to meet at some node. In treasure hunt, a single agent has to find a stationary target situated at a…

cs.DC2015

Time vs. Information Tradeoffs for Leader Election in Anonymous Trees

Christian Glacet, Avery Miller, Andrzej Pelc

The leader election task calls for all nodes of a network to agree on a single node. If the nodes of the network are anonymous, the task of leader election is formulated as follows…