5 papers
Finite Pinwheel Scheduling: the k-Visits Problem
Sotiris Kanellopoulos, Christos Pergaminelis, Maria Kokkou +2
Pinwheel Scheduling is a fundamental scheduling problem, in which each task is associated with a positive integer , and the objective is to schedule one task per time slot…
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…
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…
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…