A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Space-Optimal Time-Efficient Silent Self-Stabilizing Constructions of Constrained Spanning Trees
2015
2015 IEEE 35th International Conference on Distributed Computing Systems
Self-stabilizing algorithms are distributed algorithms supporting transient failures. Starting from any configuration, they allow the system to detect whether the actual configuration is legal, and, if not, they allow the system to eventually reach a legal configuration. In the context of network computing, it is known that, for every task, there is a self-stabilizing algorithm solving that task, with optimal space-complexity, but converging in an exponential number of rounds. On the other
doi:10.1109/icdcs.2015.66
dblp:conf/icdcs/BlinF15
fatcat:r4od2ao7gbdhpbub7tjoksvhfq