Pages that link to "Item:Q1959660"
From MaRDI portal
The following pages link to Cellular automata with sparse communication (Q1959660):
Displaying 20 items.
- Traced communication complexity of cellular automata (Q549703) (← links)
- Cellular automata with limited inter-cell bandwidth (Q549704) (← links)
- Counter machines and distributed automata -- a story about exchanging space and time (Q1656682) (← links)
- Hierarchies and undecidability results for iterative arrays with sparse communication (Q1656691) (← links)
- On two-way communication in cellular automata with a fixed number of cells (Q1763720) (← links)
- A new class of the smallest FSSP partial solutions for 1D rings of length \(n=2^k-1\) (Q2041690) (← links)
- The mirage of universality in cellular automata (Q2086715) (← links)
- On the impact of treewidth in the computational complexity of freezing dynamics (Q2117789) (← links)
- Emptiness problems for distributed automata (Q2182732) (← links)
- Iterative arrays with finite inter-cell communication (Q2278566) (← links)
- On one-way one-bit \(O\) (one)-message cellular automata (Q2811951) (← links)
- In memoriam Chandra Kintala (Q2909177) (← links)
- (Q3449996) (← links)
- (Q3592209) (← links)
- Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol (Q3596753) (← links)
- Freezing, Bounded-Change and Convergent Cellular Automata (Q5864724) (← links)
- Cold dynamics in cellular automata: a tutorial (Q6137192) (← links)
- Hierarchies and undecidability results for iterative arrays with sparse communication (Q6151193) (← links)
- Iterative arrays with finite inter-cell communication (Q6195132) (← links)
- On the parameterized complexity of freezing dynamics (Q6499443) (← links)
