4 papers
Efficient Counting and Simulation in Content-Oblivious Rings
Jérémie Chalopin, Yi-Jun Chang, Giuseppe Antonio Di Luna +1
In the content-oblivious (CO) model (proposed by Censor-Hillel et al.), processes inhabit an asynchronous network and communicate only by exchanging pulses. A series of works has c…
Beyond 2-Edge-Connectivity: Algorithms and Impossibility for Content-Oblivious Leader Election
Yi-Jun Chang, Lyuting Chen, Haoran Zhou
The content-oblivious model, introduced by Censor-Hillel, Cohen, Gelles, and Sel (PODC 2022; Distributed Computing 2023), captures an extremely weak form of communication where nod…
Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings
Jérémie Chalopin, Yi-Jun Chang, Lyuting Chen +2
We study the leader election problem in oriented ring networks under content-oblivious asynchronous message-passing systems, where an adversary may arbitrarily corrupt message cont…
Content-Oblivious Leader Election in 2-Edge-Connected Networks
Jérémie Chalopin, Yi-Jun Chang, Lyuting Chen +2
Censor-Hillel, Cohen, Gelles, and Sela (PODC 2022 & Distributed Computing 2023) studied fully-defective asynchronous networks, where communication channels may suffer an extreme fo…