54 citations · 237 across the 33 of their papers we have counts for
7 papers · 1 filter
Leveraging Structural Knowledge for Solving Election in Anonymous Networks with Shared Randomness
Jérémie Chalopin, Emmanuel Godard
We study the classical Election problem in anonymous net- works, where solutions can rely on the use of random bits, which may be either shared or unshared among nodes. We provide…
Silent Self-Stabilising Leader Election in Programmable Matter Systems with Holes
Jérémie Chalopin, Shantanu Das, Maria Kokkou
Leader election is a fundamental problem in distributed computing, particularly within programmable matter systems, where coordination among simple computational entities is crucia…
Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory
Jérémie Chalopin, Shantanu Das, Maria Kokkou
The problem of electing a unique leader is central to all distributed systems, including programmable matter systems where particles have constant size memory. In this paper, we pr…
Deterministic Leader Election for Stationary Programmable Matter with Common Direction
Jérémie Chalopin, Shantanu Das, Maria Kokkou
Leader Election is an important primitive for programmable matter, since it is often an intermediate step for the solution of more complex problems. Although the leader election pr…
Using Binoculars for Fast Exploration and Map Construction in Chordal Graphs and Extensions
Jérémie Chalopin, Emmanuel Godard, Antoine Naudin
We investigate the exploration and mapping of anonymous graphs by a mobile agent. It is long known that, without global information about the graph, it is not possible to make the…
Convergecast and Broadcast by Power-Aware Mobile Agents
Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz +3
A set of identical, mobile agents is deployed in a weighted network. Each agent has a battery -- a power source allowing it to move along network edges. An agent uses its battery p…