Showing 2021Show all
2 papers · 1 filter
cs.DC2021
Sinkless Orientation Made Simple
Alkida Balliu, Janne H. Korhonen, Fabian Kuhn +9
The sinkless orientation problem plays a key role in understanding the foundations of distributed computing. The problem can be used to separate two fundamental models of distribut…
cs.DC2021
Locally Checkable Problems in Rooted Trees
Alkida Balliu, Sebastian Brandt, Yi-Jun Chang +4
Consider any locally checkable labeling problem in rooted regular trees: there is a finite set of labels , and for each label we specify what are permitted label c…