Unconventional Computation
From MaRDI portal
Publication:5479216
Recommendations
- A new time-optimum synchronization algorithm for rectangle arrays
- An optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays
- An optimum-time square synchronization algorithm. One-sided recursive-halving marking based
- A new optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays: one-sided recursive halving based
- A seven-state time-optimum square synchronizer
Cited in
(14)- Two-dimensional cellular automata synchronizers
- Synchronizing square arrays in optimum-time
- Faster synchronization in P systems
- scientific article; zbMATH DE number 2016494 (Why is no real title available?)
- A new time-optimum synchronization algorithm for rectangle arrays
- A class of time-optimum FSSP algorithms for multi-dimensional cellular arrays
- Time-optimum smaller-state synchronizers for cellular automata
- A Design of Symmetrical Six-State 3n-Step Firing Squad Synchronization Algorithms and Their Implementations
- An optimum-time square synchronization algorithm. One-sided recursive-halving marking based
- A seven-state time-optimum square synchronizer
- A simple optimum-time FSSP algorithm for multi-dimensional cellular automata
- An optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays
- A new optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays: one-sided recursive halving based
- Machines, Computations, and Universality
This page was built for publication: Unconventional Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5479216)