2 citations · 4 across the 4 of their papers we have counts for
5 papers
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…
Cost vs. Information Tradeoffs for Treasure Hunt in the Plane
Andrzej Pelc, Ram Narayan Yadav
A mobile agent has to find an inert treasure hidden in the plane. Both the agent and the treasure are modeled as points. This is a variant of the task known as treasure hunt. The t…
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…
Advice Complexity of Treasure Hunt in Geometric Terrains
Andrzej Pelc, Ram Narayan Yadav
Treasure hunt is the task of finding an inert target by a mobile agent in an unknown environment. We consider treasure hunt in geometric terrains with obstacles. Both the terrain a…
Using Time to Break Symmetry: Universal Deterministic Anonymous Rendezvous
Andrzej Pelc, Ram Narayan Yadav
Two anonymous mobile agents navigate synchronously in an anonymous graph and have to meet at a node, using a deterministic algorithm. This is a symmetry breaking task called rendez…