Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position
type: Item
instance of: scholarly article
title: Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position
zbMATH Open document ID: 0496.68037
DOI: 10.1016/0304-3975(82)90040-8
author: Helge Szwerinski
published in: Theoretical Computer Science
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q80
zbMATH DE Number: 3782389
zbMATH Keywords: cellular automata
MaRDI profile type: Publication
full work available at URL: 0304-3975(82)90040-8
OpenAlex ID: W2051579987
cites work: An 8-state minimal time solution to the firing squad synchronization problem
cites work: Models for cellular interactions in development without polarity of individual cells II. Problems of synchronization and regulation
cites work: Q5525259
cites work: A generalized firing squad problem
cites work: Two- and three-dimensional firing-squad synchronization problems
cites work: Q3315000
cites work: Synchronization of interacting automata
cites work: Q5674976
description: scientific article; zbMATH DE number 3782389