We present the first self-stabilizing algorithm for leader election in arbitrary topologies whose space complexity is O(max{log Delta, log log n}) bits per node, where n is the network size and Delta its degree. This complexity is sub-logarithmic in n when Delta = n^o(1).
展开▼
机译：我们提出了第一个自稳定算法，用于任意拓扑中的领导者选举，其空间复杂度是每个节点O（max {log Delta，log log n}）位，其中n是网络规模，Delta是其度数。当Delta = n ^ o（1）时，此复杂度在n中为次对数形式。
展开▼
