2 citations · 3 across the 5 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.DS2023
Fast Deterministic Rendezvous in Labeled Lines
Avery Miller, Andrzej Pelc
Two mobile agents, starting from different nodes of a network modeled as a graph, and woken up at possibly different times, have to meet at the same node. This problem is known as…
cs.DC2023
Computing Functions by Teams of Deterministic Finite Automata
Debasish Pattanayak, Andrzej Pelc
We consider the task of computing functions , where is the set of natural numbers, by finite teams of agents modelled as deterministic…
cs.DC2023
Deterministic Treasure Hunt and Rendezvous in Arbitrary Connected Graphs
Debasish Pattanayak, Andrzej Pelc
Treasure hunt and rendezvous are fundamental tasks performed by mobile agents in graphs. In treasure hunt, an agent has to find an inert target (called treasure) situated at an unk…