Sylvain Gay

According to our database, Sylvain Gay authored at least 4 papers between 2024 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs.

Lelia Blin, Sylvain Gay, Isabella Ziccardi

CoRR, February, 2026

What Can Be Computed Locally Revisited: First-Order Logic on Sparse Graphs in Distributed Computing.

Lélia Blin, Fedor V. Fomin, Pierre Fraigniaud, Sylvain Gay, Petr A. Golovach, Pedro Montealegre, Ivan Rapaport, Ioan Todinca

Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

2024

Brief Announcement: No Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing Systems.

Sylvain Gay, Achour Mostéfaoui, Matthieu Perrin

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

No Symmetric Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing Systems.

Sylvain Gay, Achour Mostéfaoui, Matthieu Perrin

Proceedings of the 28th International Conference on Principles of Distributed Systems, 2024