Leader election in d-dimensional CA in time diam log(diam)

Authors:
Michael Stratmann;Thomas Worsch
Affiliations:
Fakultät für Informatik, Universität Karlsruhe, Am Fasanengarten 5, D-76128 Karksruhe, Germany;Fakultät für Informatik, Universität Karlsruhe, Am Fasanengarten 5, D-76128 Karksruhe, Germany
Venue:
Future Generation Computer Systems - Cellular automata CA 2000 and ACRI 2000
Year:
2002

Citing 4
Cited 1

A six-state minimal time solution to the firing squad synchronization problem

Theoretical Computer Science
Discrete parabolas and circles on 2D cellular automata

Theoretical Computer Science - Special issue on Caen '97
Compass permits leader election

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A perimeter—time CA for the queen bee problem

Parallel Computing - Special issue on cellular automata: from modeling to applications

Leader election in plane cellular automata, only with left-right global convention

Theoretical Computer Science - Combinatorics of the discrete plane and tilings

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 Θ (diam log(diam)), where diam denotes the diameter of the pattern.