Theory

I am interested in supervising theoretical work on Distributed Computing Algorithms:

• Computing on anonymous dynamic networks: a set of processes lives a network that is dynamic, the communication graph changes as the time passes, the processes do not have IDs and have to solve a common goal (read this paper -- accepted at FOCS 2022).

• Byzantine Agreement Algorithms for weaker variants of Consensus (read this paper);

• Mobile Robots: a set of anonymous entities that move in the two-dimensional plane has to solve some common goal (read this paper);

• Mobile Agents on dynamic graphs: a set of mobile agents move on top of a dynamic graph to solve a task. Examples are: exploration, gathering,... (read this paper);

• Programmable Matter: you have tiny entities that move on a discrete space, usually, a triangular grid to solve a task. (read this paper).