Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata
From MaRDI portal
Recommendations
- On the complexity of asynchronous freezing cellular automata
- On the complexity of the stability problem of binary freezing totalistic cellular automata
- Universality in freezing cellular automata
- Computing issues of asynchronous CA
- On the computational complexity of the freezing non-strict majority automata
Cites work
- A Fast Parallel Algorithm for the Robust Prediction of the Two-Dimensional Strict Majority Automaton
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- Parallel Algorithms in Graph Theory: Planarity Testing
- Statistical mechanics of cellular automata
- The complexity of the bootstraping percolation and other problems
Cited in
(8)- Universality in freezing cellular automata
- On the complexity of asynchronous freezing cellular automata
- On the impact of treewidth in the computational complexity of freezing dynamics
- On the complexity of the stability problem of binary freezing totalistic cellular automata
- Stable patterns formation by totalistic cellular automata
- Parallel implementation of asynchronous cellular automata on a 32-core computer
- Cold dynamics in cellular automata: a tutorial
- On the parameterized complexity of freezing dynamics
This page was built for publication: Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163609)