Leader election in d-dimensional CA in time diam log(diam)
Cellular automata for the election of a leader in arbitrary d-dimensional patterns are presented which are significantly faster than the previously best known. The time needed is reduced from ?(diam2) to , where diam denotes the diameter of the pattern.
leader election d-dimensional pattern queen bee problem concentration problem cellular automaton