Skip to search formSkip to main contentSkip to account menu

Firing squad synchronization problem

Known as: FSSP, Firing squad (disambiguation), Firing squad problem 
The firing squad synchronization problem is a problem in computer science and cellular automata in which the goal is to design a cellular automaton… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
A New Kind of ScienceCellular automatonCoDiComputer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Cutting the Firing Squad Synchronization
The firing squad synchronization problem on Cellular Automata (CA) has been studied extensively for many years, and a rich… 
Review
2014
Review
2014
Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem
In this paper we present a survey on the minimum and non minimum time solutions to the Firing Squad Synchronization Problem… 
2012
2012
On Minimal-Time Solutions of Firing Squad Synchronization Problems for Networks
The goal of this work is to show that if a minimal-time solution exists for a fundamental computation primitive, synchronizing… 
2011
2011
Partial solutions for the firing squad synchronization problem on rings
The Firing Squad Synchronization Problem (FSSP) is an old problem in theoretical Computer Science concerned with the… 
2009
2009
New Solutions to the Firing Squad Synchronization Problems for Neural and Hyperdag P Systems
We propose two uniform solutions to an open question: the Firing Squad Synchronization Problem (FSSP), for hyperdag and symmetric… 
2007
2007
Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4n-Steps Solution
We present a new family of solutions to the firing squad synchronization problem. All these solutions are built with a few finite… 
2006
2006
Different time solutions for the firing squad synchronization problem on basic grid networks
We present several solutions to the Firing Squad Synchronization Problem on grid networks of different shapes. The nodes are… 
2005
2005
On Formulations of Firing Squad Synchronization Problems
We propose a novel formulation of the firing squad synchronization problem. In this formulation we may use more than one general… 
2005
2005
Various Solutions to the Firing Squad Synchronization Problems
We present different classes of solutions to the Firing Squad Synchronization Problem on networks of different shapes. The nodes… 
2004
2004
Optimal Time and Communication Solutions of Firing Squad Synchronization Problems on Square Arrays, Toruses and Rings
A new solution for the Firing Squad Synchronization Problem (FSSP) on two-dimensional square arrays is presented and its… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)