research
∙
10/28/2020
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs
A mobile agent navigating along edges of a simple connected graph, eithe...
share
research
∙
05/02/2020
Almost Universal Anonymous Rendezvous in the Plane
Two mobile agents represented by points freely moving in the plane and s...
research
∙
05/02/2020
Deterministic Treasure Hunt in the Plane with Angular Hints
A mobile agent equipped with a compass and a measure of length has to fi...
research
∙
08/29/2019
Want to Gather? No Need to Chatter!
A team of mobile agents, starting from different nodes of an unknown net...
research
∙
01/23/2018
Byzantine Gathering in Polynomial Time
We study the task of Byzantine gathering in a network modeled as a graph...
research
∙
10/20/2017
Deterministic Rendezvous at a Node of Agents with Arbitrary Velocities
We consider the task of rendezvous in networks modeled as undirected gra...
research
∙
02/20/2012
Deterministic Leader Election Among Disoriented Anonymous Sensors
We address the Leader Election (LE) problem in networks of anonymous sen...
research
∙
02/17/2009
