The following pages link to Nazim Fatès (Q256415):
Displaying 43 items.
- Probing robustness of cellular automata through variations of asynchronous updating (Q256417) (← links)
- First steps on asynchronous lattice-gas models with an application to a swarming rule (Q269778) (← links)
- Stochastic cellular automata solutions to the density classification problem. When randomness helps computing (Q372972) (← links)
- Density classification on infinite lattices and trees (Q388922) (← links)
- Diploid cellular automata: first experiments on the random mixtures of two elementary rules (Q1704106) (← links)
- Local structure approximation as a predictor of second-order phase transitions in asynchronous cellular automata (Q2003483) (← links)
- Amoebae for clustering: a bio-inspired cellular automata method for data classification (Q2086744) (← links)
- Cellular automata for the self-stabilisation of colourings and tilings (Q2330596) (← links)
- Fully asynchronous behavior of double-quiescent elementary cellular automata (Q2508958) (← links)
- (Q2811213) (← links)
- A Guided Tour of Asynchronous Cellular Automata (Q2851298) (← links)
- A Note on the Classification of the Most Simple Asynchronous Cellular Automata (Q2851299) (← links)
- A Robustness Approach to Study Metastable Behaviours in a Lattice-Gas Model of Swarming (Q2851302) (← links)
- Density Classification on Infinite Lattices and Trees (Q2894458) (← links)
- (Q2965869) (← links)
- Brothers in Arms? On AI Planning and Cellular Automata (Q2999137) (← links)
- Robustness of Cellular Automata in the Light of Asynchronous Information Transmission (Q3007704) (← links)
- Stochastic Cellular Automata Solve the Density Classification Problem with an Arbitrary Precision (Q3113693) (← links)
- Two-Dimensional Traffic Rules and the Density Classification Problem (Q3186480) (← links)
- Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata (Q3525781) (← links)
- Directed Percolation Phenomena in Asynchronous Elementary Cellular Automata (Q3540032) (← links)
- Examples of Fast and Slow Convergence of 2D Asynchronous Cellular Systems (Q3541761) (← links)
- (Q3605709) (← links)
- (Q3654100) (← links)
- (Q4451027) (← links)
- A Trade-Off Between Simplicity and Robustness? Illustration on a Lattice-Gas Model of Swarming (Q4558944) (← links)
- (Q4912167) (← links)
- Translating Discrete Multi-Agents Systems into Cellular Automata: Application to Diffusion-Limited Aggregation (Q4932633) (← links)
- Self-stabilisation of Cellular Automata on Tilings (Q5066069) (← links)
- Asynchronous Cellular Automata (Q5072489) (← links)
- On the Reversibility of ECAs with Fully Asynchronous Updating: The Recurrence Point of View (Q5112178) (← links)
- (Q5321519) (← links)
- Reversibility of Elementary Cellular Automata under Fully Asynchronous Update (Q5410634) (← links)
- Perturbing the Topology of the Game of Life Increases Its Robustness to Asynchrony (Q5464069) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492868) (← links)
- Turing et la dimension ontologique du jeu (Q5499641) (← links)
- Remarks on the Cellular Automaton Global Synchronisation Problem (Q5500617) (← links)
- A tutorial on elementary cellular automata with fully asynchronous updating. General properties and convergence dynamics (Q6151165) (← links)
- Remarks on the cellular automaton global synchronisation problem: deterministic versus stochastic models (Q6191400) (← links)
- Self-stabilisation of cellular automata on tilings (Q6359386) (← links)
- A decentralised diagnosis method with probabilistic cellular automata (Q6546065) (← links)
- Reversibility of elementary cellular automata with fully asynchronous updating: an analysis of the rules with partial recurrence (Q6590088) (← links)
- Asynchronous cellular systems that solve the parity problem (Q6637844) (← links)
