5 papers · 1 filter
Distance-based certification for leader election in meshed graphs and local recognition of their subclasses
Jérémie Chalopin, Victor Chepoi, Maria Kokkou
In this paper, we present a 2-local proof labeling scheme with labels in for leader election in anonymous meshed graphs. Meshed graphs form a general class of graphs d…
Leader Election via Unique Sink Orientation
Jérémie Chalopin, Maria Kokkou
A Locally Checkable Labeling (LCL) is a distributed constraint satisfaction problem defined on a bounded-degree graph that relates a finite set of input labels to a finite set of o…
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…