3 papers
cs.DC2026
Stone Duality Proofs for Colorless Distributed Computability Theorems
Cameron Calk, Emmanuel Godard
We introduce a new topological encoding of executions of round-based, full-information distributed protocols via spectral spaces. Such protocols constitute a model of distributed c…
cs.DC2026
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…
cs.DC2025
A General Input-Dependent Colorless Computability Theorem and Applications to Core-Dependent Adversaries
Yannis Coutouly, Emmanuel Godard
Distributed computing tasks can be presented with a triple $(\I,\Ou,Î)$. The solvability of a colorless task on the Iterated Immediate Snapshot model (IIS) has been characterized…