2 citations · 2 across the 2 of their papers we have counts for
3 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…
Optimal Computation in Anonymous Dynamic Networks
Giuseppe A. Di Luna, Giovanni Viglietta
We give a simple characterization of the functions that can be computed deterministically by anonymous processes in dynamic networks, depending on the number of leaders in the netw…
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…