2 papers
cs.DC2026
Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
Lelia Blin, Sylvain Gay, Isabella Ziccardi
We study the self-stabilizing leader election problem in anonymous -nodes networks. Achieving self-stabilization with low space memory complexity is particularly challenging, an…
cs.DS2026
What Can Be Computed Locally Revisited: First-Order Logic on Sparse Graphs in Distributed Computing
Lélia Blin, Fedor V. Fomin, Pierre Fraigniaud +5
The question of 'what can be computed locally?' lies at the heart of distributed computing in networks. As established in Naor and Stockmeyer's seminal paper (STOC 1993), this ques…