25 citations · 126 across the 37 of their papers we have counts for
4 papers · 2 filters
Asynchronous Broadcasting with Bivalent Beeps
Kokouvi Hounkanli, Andrzej Pelc
In broadcasting, one node of a network has a message that must be learned by all other nodes. We study deterministic algorithms for this fundamental communication task in a very we…
Convergecast and Broadcast by Power-Aware Mobile Agents
Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz +3
A set of identical, mobile agents is deployed in a weighted network. Each agent has a battery -- a power source allowing it to move along network edges. An agent uses its battery p…
Topology Recognition and Leader Election in Colored Networks
Dariusz Dereniowski, Andrzej Pelc
Topology recognition and leader election are fundamental tasks in distributed computing in networks. The first of them requires each node to find a labeled isomorphic copy of the n…
Topology recognition with advice
Emanuele Guido Fusco, Andrzej Pelc, Rossella Petreschi
In topology recognition, each node of an anonymous network has to deterministically produce an isomorphic copy of the underlying graph, with all ports correctly marked. This task i…