Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings

Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures 2026 Open access

Read full text
Authors: Jérémie Chalopin, Yi‐Jun Chang, Lyuting Chen, Giuseppe Antonio Di Luna, Haoran Zhou
DOI: 10.1145/3816782.3819193
Cited by: 1
References: 31

Abstract

We study leader election in oriented ring networks under a content-oblivious asynchronous message-passing model in which an adversary may arbitrarily corrupt message contents. This highly stringent model captures extreme communication unreliability.

Fields of Study & Subjects

Distributed systems and fault tolerance Complexity and Algorithms in Graphs Opportunistic and Delay-Tolerant Networks

Publication details

Journal / source
Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures
Publisher
ACM
Pages
490–502
Publication date
6 July 2026
Language
EN