scientific article; zbMATH DE number 3305051
From MaRDI portal
Publication:5586352
Cited in
(33)- State-efficient realization of fault-tolerant FSSP algorithms
- An adaptive algorithm for P system synchronization
- Revisiting the cutting of the firing squad synchronization
- The firing squad synchronization problem for graphs
- On time optimal solutions of the firing squad synchronization problem for two-dimensional paths
- Error detection and correction in firing squad synchronization problem
- Synchronization and computing capabilities of linear asynchronous structures
- A class of time-optimum FSSP algorithms for multi-dimensional cellular arrays
- Smaller solutions for the firing squad
- On the minimal firing time of the firing squad synchronization problem for polyautomata networks
- Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
- The firing squad synchronization problem for a class of polyautomata networks
- A new reconstruction and the first implementation of Goto's FSSP algorithm
- The minimum firing time of the generalized firing squad synchronization problem for squares
- Algorithmic and complexity issues of robot motion in an uncertain environment
- Time-optimum smaller-state synchronizers for cellular automata
- A design of generalized minimum-state-change FSSP algorithms and their implementations
- The firing squad problem revisited
- The firing squad problem revisited
- Synchronization of interacting automata
- Cutting the Firing Squad Synchronization
- Implementations of FSSP Algorithms on Fault-Tolerant Cellular Arrays
- Intrinsically universal \(n\)-dimensional quantum cellular automata
- Invertible cellular automata: A review
- (A-)synchronous (non)-deterministic cell spaces simulating each other
- The firing squad synchronization problem with sub-generals
- About 4-States Solutions to the Firing Squad Synchronization Problem
- A seven-state time-optimum square synchronizer
- A 4-states algebraic solution to linear cellular automata synchronization
- FSSP algorithms for 2D rectangular arrays. Recent developments
- A new optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays: one-sided recursive halving based
- The firing squad synchronization problem on CA with multiple updating cycles
- Firing squad synchronization problem in reversible cellular automata
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5586352)