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 2017 · cs.DCShow all

9 papers · 2 filters

cs.DC2017

Constant-Length Labeling Schemes for Deterministic Radio Broadcast

Faith Ellen, Barun Gorain, Avery Miller +1

Broadcast is one of the fundamental network communication primitives. One node of a network, called the , has a message that has to be learned by all other nodes.…

cs.DC2017

Deterministic meeting of sniffing agents in the plane

Samir Elouasbi, Andrzej Pelc

Two mobile agents, starting at arbitrary, possibly different times from arbitrary locations in the plane, have to meet. Agents are modeled as discs of diameter 1, and meeting occur…

cs.DC2017

Deterministic rendezvous with detection using beeps

Samir Elouasbi, Andrzej Pelc

Two mobile agents, starting at arbitrary, possibly different times from arbitrary nodes of an unknown network, have to meet at some node. Agents move in synchronous rounds: in each…

cs.DC2017

Use of Information, Memory and Randomization in Asynchronous Gathering

Andrzej Pelc

We investigate initial information, unbounded memory and randomization in gathering mobile agents on a grid. We construct a state machine, such that it is possible to gather, with…

cs.DC2017

Deterministic Distributed Construction of -Dominating Sets in Time

Avery Miller, Andrzej Pelc

A -dominating set is a set of nodes of a graph such that, for each node , there exists a node at distance at most from . Our aim is the deterministic dis…

cs.DC2017

Deterministic Gathering with Crash Faults

Andrzej Pelc

A team consisting of an unknown number of mobile agents, starting from different nodes of an unknown network, have to meet at the same node and terminate. This problem is known as…