25 citations · 126 across the 37 of their papers we have counts for
31 papers · 1 filter
Rendezvous of Mobile Deterministic Automata in Graphs
Bibhuti Das, Andrzej Pelc
Two mobile agents, modeled as identical deterministic finite automata (DFA) navigating in synchronous rounds in a graph with unlabeled nodes, have to meet at some node. The well-re…
Deterministic Rendezvous Algorithms
Andrzej Pelc
The task of rendezvous (also called {\em gathering}) calls for a meeting of two or more mobile entities, starting from different positions in some environment. Those entities are c…
Deterministic Rendezvous in Infinite Trees
Subhash Bhagat, Andrzej Pelc
The rendezvous task calls for two mobile agents, starting from different nodes of a network modeled as a graph to meet at the same node. Agents have different labels which are inte…
Four Shades of Deterministic Leader Election in Anonymous Networks
Barun Gorain, Avery Miller, Andrzej Pelc
Leader election is one of the fundamental problems in distributed computing: a single node, called the leader, must be specified. This task can be formulated either in a weak way,…
Deterministic Leader Election in Anonymous Radio Networks
Avery Miller, Andrzej Pelc, Ram Narayan Yadav
We consider leader election in anonymous radio networks modeled as simple undirected connected graphs. Nodes communicate in synchronous rounds. Nodes are anonymous and execute the…
Latecomers Help to Meet: Deterministic Anonymous Gathering in the Plane
Andrzej Pelc, Ram Narayan Yadav
A team of anonymous mobile agents represented by points freely moving in the plane have to gather at a single point and stop. Agents start at different points of the plane and at p…