54 citations · 237 across the 33 of their papers we have counts for
36 papers
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…
Isometric path complexity of graphs
Dibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud +1
A set of isometric paths of a graph is ``-rooted'', where is a vertex of , if is one of the endpoints of all the isometric paths in . The isometric path co…
Sample compression schemes for balls in graphs
Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney +2
One of the open problems in machine learning is whether any set-family of VC-dimension admits a sample compression scheme of size . In this paper, we study this problem f…