Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem
From MaRDI portal
Publication:2944883
DOI10.1007/978-3-319-13350-8_9zbMath1323.68396OpenAlexW178561310MaRDI QIDQ2944883
Publication date: 8 September 2015
Published in: Computing with New Resources (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-13350-8_9
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A six-state minimal time solution to the Firing squad synchronization problem
- Variations of the firing squad problem and applications
- On optimal solutions to the firing squad synchronization problem
- A Compositional Approach to Synchronize Two Dimensional Networks of Processors
- An 8-state minimal time solution to the firing squad synchronization problem
- An Optimal Self-Stabilizing Firing Squad
- On Minimal-Time Solutions of Firing Squad Synchronization Problems for Networks
- Different time solutions for the firing squad synchronization problem on basic grid networks
- THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS
- An optimum solution to the firing squad synchronization problem
- Two- and three-dimensional firing-squad synchronization problems
- The firing squad synchronization problem for two-dimensional arrays
- Recent Developments in Constructing Square Synchronizers
- The Distributed Firing Squad Problem
- An Investigation into Transition Rule Sets for Optimum-time Firing Squad Synchronization Algorithms on One-dimensional Cellular Automata
- A Seven-State Time-Optimum Square Synchronizer
- On the Complexity of Network Synchronization
- A generalized firing squad problem
- Developments in Language Theory
- On time optimal solutions of the firing squad synchronization problem for two-dimensional paths
This page was built for publication: Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem
