scientific article
From MaRDI portal
Publication:3357556
zbMath0731.68080MaRDI QIDQ3357556
Publication date: 1991
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
parallel algorithmsfault tolerancetime complexityfiring squad synchronization problemmassively parallel systemsdefective cellular automata
Related Items (5)
Cutting the Firing Squad Synchronization ⋮ Revisiting the cutting of the firing squad synchronization ⋮ State-efficient realization of fault-tolerant FSSP algorithms ⋮ The firing squad synchronization problem on CA with multiple updating cycles ⋮ Nature-Based Problems in Cellular Automata
This page was built for publication: