Recent developments in constructing square synchronizers
From MaRDI portal
Publication:4649804
DOI10.1007/978-3-642-33350-7_18zbMATH Open1360.68620OpenAlexW51749637MaRDI QIDQ4649804FDOQ4649804
Authors: Keisuke Kubo, Hiroshi Umeo
Publication date: 14 November 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-33350-7_18
Recommendations
- Synchronizing square arrays in optimum-time
- How to synchronize cellular automata -- recent developments
- Recent developments in firing squad synchronization algorithms for two-dimensional cellular automata and their state-efficient implementations
- Firing squad synchronization algorithms for two-dimensional cellular automata
- FSSP algorithms for 2D rectangular arrays. Recent developments
Cited In (8)
- A new synchronizer design
- Minimum and non-minimum time solutions to the firing squad synchronization problem
- The minimum firing time of the generalized firing squad synchronization problem for squares
- How to synchronize cellular automata -- recent developments
- Firing squad synchronization algorithms for two-dimensional cellular automata
- Recent developments in firing squad synchronization algorithms for two-dimensional cellular automata and their state-efficient implementations
- A seven-state time-optimum square synchronizer
- Synchronizing square arrays in optimum-time
This page was built for publication: Recent developments in constructing square synchronizers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649804)