Showing cs.DCShow all
3 papers · 1 filter
cs.DC2026
Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks
Yi-Jun Chang, Yang Ze Guan
We study the aggregation problem in synchronous multi-hop radio networks with -bit messages and no collision detection. Each node initially holds a value, and the goal i…
cs.DC2026
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…
cs.DC2023
The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees
Yi-Jun Chang
We consider locally checkable labeling LCL problems in the LOCAL model of distributed computing. Since 2016, there has been a substantial body of work examining the possible comple…