default search action
Nazim Fatès
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j21]Souvik Roy, Nazim Fatès, Sukanta Das:
Reversibility of elementary cellular automata with fully asynchronous updating: An analysis of the rules with partial recurrence. Theor. Comput. Sci. 1011: 114721 (2024) - [c37]Nazim Fatès:
Asynchronous Cellular Systems that Solve the Parity Problem. AUTOMATA 2024: 133-145 - 2023
- [b1]Nazim Fatès:
Robustesse des systèmes complexes : étude du rôle de l'aléa dans la dynamique des automates cellulaires. University of Lorraine, Nancy, France, 2023 - [c36]Nazim Fatès, Régine Marchand, Irène Marcovici:
A Decentralised Diagnosis Method with Probabilistic Cellular Automata. AUTOMATA 2023: 60-73 - [c35]Joannès Guichon, Nazim Fatès, Sylvain Contassot-Vivier, Massimo Amato:
Properties of B2B Invoice Graphs and Detection of Structures. COMPLEX NETWORKS (3) 2023: 444-455 - 2022
- [j20]Nazim Fatès, Irène Marcovici, Siamak Taati:
Self-stabilisation of Cellular Automata on Tilings. Fundam. Informaticae 185(1): 27-82 (2022) - [c34]Amaury Saint-Jore, Nazim Fatès, Emmanuel Jeandel:
Amoebae for Clustering: A Bio-Inspired Cellular Automata Method for Data Classification. Automata and Complexity 2022: 417-432 - 2021
- [i2]Nazim Fatès, Irène Marcovici, Siamak Taati:
Self-stabilisation of cellular automata on tilings. CoRR abs/2101.12682 (2021) - 2020
- [j19]Nazim Fatès:
A tutorial on elementary cellular automata with fully asynchronous updating. Nat. Comput. 19(1): 179-197 (2020)
2010 – 2019
- 2019
- [j18]Nazim Fatès:
Remarks on the cellular automaton global synchronisation problem: deterministic versus stochastic models. Nat. Comput. 18(3): 429-444 (2019) - [c33]Nicolas Gauville, Nazim Fatès, Irène Marcovici:
Diagnostic décentralisé à l'aide d'automates cellulaires. JFSMA 2019: 107-116 - [c32]Nazim Fatès, Irène Marcovici, Siamak Taati:
Cellular Automata for the Self-stabilisation of Colourings and Tilings. RP 2019: 121-136 - 2018
- [c31]Nazim Fatès:
A Pedagogical Example: A Family of Stochastic Cellular Automata that Plays Alesia. ACRI 2018: 385-395 - [p2]Nazim Fatès, Biswanath Sethi, Sukanta Das:
On the Reversibility of ECAs with Fully Asynchronous Updating: The Recurrence Point of View. Reversibility and Universality 2018: 313-332 - 2017
- [c30]Nazim Fatès:
Diploid Cellular Automata: First Experiments on the Random Mixtures of Two Elementary Rules. AUTOMATA 2017: 97-108 - 2016
- [c29]Nazim Fatès:
Collective Infotaxis with Reactive Amoebae: A Note on a Simple Bio-inspired Mechanism. ACRI 2016: 157-165 - [c28]Nazim Fatès, Irène Marcovici, Siamak Taati:
Two-Dimensional Traffic Rules and the Density Classification Problem. Automata 2016: 135-148 - 2015
- [j17]Henryk Fuks, Nazim Fatès:
Local structure approximation as a predictor of second-order phase transitions in asynchronous cellular automata. Nat. Comput. 14(4): 507-522 (2015) - [j16]Nazim Fatès, Sylvain Sené:
Introduction. Tech. Sci. Informatiques 34(4): 357-360 (2015) - [c27]Nazim Fatès:
Remarks on the Cellular Automaton Global Synchronisation Problem. Automata 2015: 113-126 - 2014
- [j15]Nazim Fatès:
A Guided Tour of Asynchronous Cellular Automata. J. Cell. Autom. 9(5-6): 387-416 (2014) - [c26]Henryk Fuks, Nazim Fatès:
Bifurcations of Local Structure Maps as Predictors of Phase Transitions in Asynchronous Cellular Automata. ACRI 2014: 556-560 - [c25]Nazim Fatès:
Quick Convergence to a Fixed Point: A Note on Asynchronous Elementary Cellular Automata. ACRI 2014: 586-595 - [c24]Biswanath Sethi, Nazim Fatès, Sukanta Das:
Reversibility of Elementary Cellular Automata under Fully Asynchronous Update. TAMC 2014: 39-49 - 2013
- [j14]Nazim Fatès:
Stochastic Cellular Automata Solutions to the Density Classification Problem - When Randomness Helps Computing. Theory Comput. Syst. 53(2): 223-242 (2013) - [j13]Alberto Dennunzio, Nazim Fatès, Enrico Formenti:
Foreword: asynchronous cellular automata and applications. Nat. Comput. 12(4): 537-538 (2013) - [j12]Olivier Bouré, Nazim Fatès, Vincent Chevrier:
First steps on asynchronous lattice-gas models with an application to a swarming rule. Nat. Comput. 12(4): 551-560 (2013) - [c23]Nazim Fatès:
A Guided Tour of Asynchronous Cellular Automata. Automata 2013: 15-30 - [c22]Nazim Fatès:
A Note on the Classification of the Most Simple Asynchronous Cellular Automata. Automata 2013: 31-45 - [c21]Olivier Bouré, Nazim Fatès, Vincent Chevrier:
A Robustness Approach to Study Metastable Behaviours in a Lattice-Gas Model of Swarming. Automata 2013: 84-97 - 2012
- [j11]Selma Belgacem, Nazim Fatès:
Robustness of Multi-agent Models: The Example of Collaboration between Turmites with Synchronous and Asynchronous Updating. Complex Syst. 21(3) (2012) - [j10]Nazim Fatès, Nikolaos Vlassopoulos:
A Robust Scheme for Aggregating Quasi-Blind Robots in an Active Environment. Int. J. Swarm Intell. Res. 3(3): 66-80 (2012) - [j9]Nikolaos Vlassopoulos, Nazim Fatès, Hugues Berry, Bernard Girau:
Large-scale Simulations on FPGAs: Finding the Asymptotic Critical Threshold of the Greenberg-Hastings Cellular Automata. J. Cell. Autom. 7(1): 5-29 (2012) - [j8]Nazim Fatès:
Preface. J. Cell. Autom. 7(2): 81-82 (2012) - [j7]Olivier Bouré, Nazim Fatès, Vincent Chevrier:
Probing robustness of cellular automata through variations of asynchronous updating. Nat. Comput. 11(4): 553-564 (2012) - [c20]Olivier Bouré, Nazim Fatès, Vincent Chevrier:
First Steps on Asynchronous Lattice-Gas Models with an Application to a Swarming Rule. ACRI 2012: 633-642 - [c19]Ana Busic, Nazim Fatès, Jean Mairesse, Irène Marcovici:
Density Classification on Infinite Lattices and Trees. LATIN 2012: 109-120 - 2011
- [j6]Hugues Berry, Nazim Fatès:
Robustness of the Critical Behaviour in the Stochastic Greenberg-Hastings Cellular Automaton Model. Int. J. Unconv. Comput. 7(1-2): 65-85 (2011) - [c18]Nikolaos Vlassopoulos, Nazim Fatès:
Clustering behavior of a bio-inspired decentralized aggregation scheme. ECAL 2011: 836-837 - [c17]Nazim Fatès:
Stochastic Cellular Automata Solve the Density Classification Problem with an Arbitrary Precision. STACS 2011: 284-295 - [c16]Olivier Bouré, Nazim Fatès, Vincent Chevrier:
Robustness of Cellular Automata in the Light of Asynchronous Information Transmission. UC 2011: 52-63 - [e2]Nazim Fatès, Eric Goles Chacc, Alejandro Maass, Ivan Rapaport:
17th International Workshop on Cellular Automata and Discrete Complex Systems, Automata 2011, Center for Mathematical Modeling, University of Chile, Santiago, Chile, November 21-23, 2011. DMTCS Proceedings AP, DMTCS 2011 [contents] - [i1]Ana Busic, Nazim Fatès, Jean Mairesse, Irène Marcovici:
Density classification on infinite lattices and trees. CoRR abs/1111.4582 (2011) - 2010
- [j5]Nazim Fatès:
Solving the decentralised gathering problem with a reaction-diffusion-chemotaxis scheme. Swarm Intell. 4(2): 91-115 (2010) - [c15]Nazim Fatès, Vincent Chevrier:
How important are updating schemes in multi-agent systems? An illustration on a multi-turmite model. AAMAS 2010: 533-540 - [c14]Jörg Hoffmann, Nazim Fatès, Héctor Palacios:
Brothers in Arms? On AI Planning and Cellular Automata. ECAI 2010: 223-228 - [c13]Nikolaos Vlassopoulos, Nazim Fatès, Hugues Berry, Bernard Girau:
An FPGA design for the stochastic Greenberg-Hastings cellular automata. HPCS 2010: 565-574 - [p1]Nazim Fatès:
Does Life Resist Asynchrony? Game of Life Cellular Automata 2010: 257-274 - [e1]Nazim Fatès, Jarkko Kari, Thomas Worsch:
Automata 2010 - 16th Intl. Workshop on CA and DCS, Nancy, France, June 14-16, 2010. DMTCS Proceedings AL, DMTCS 2010 [contents]
2000 – 2009
- 2009
- [j4]Nazim Fatès:
Asynchronism Induces Second-Order Phase Transitions in Elementary Cellular Automata. J. Cell. Autom. 4(1): 21-38 (2009) - [j3]Nazim Fatès, Lucas Gerin:
Examples of Fast and Slow Convergence of 2D Asynchronous Cellular Systems. J. Cell. Autom. 4(4): 323-337 (2009) - [c12]Antoine Spicher, Nazim Fatès, Olivier Simonin:
Translating Discrete Multi-Agents Systems into Cellular Automata: Application to Diffusion-Limited Aggregation. ICAART (Revised Selected Papers) 2009: 270-282 - [c11]Antoine Spicher, Nazim Fatès, Olivier Simonin:
From Reactive Multi-Agents Models to Cellular Automata - Illustration on a Diffusion-Limited Aggregation Model. ICAART 2009: 422-429 - [c10]Nazim Fatès, Hugues Berry:
Robustness of the Critical Behaviour in a Discrete Stochastic Reaction-Diffusion Medium. IWNC 2009: 141-148 - 2008
- [c9]Nazim Fatès, Lucas Gerin:
Examples of Fast and Slow Convergence of 2D Asynchronous Cellular Systems. ACRI 2008: 184-191 - 2006
- [j2]Nazim Fatès, Eric Thierry, Michel Morvan, Nicolas Schabanel:
Fully asynchronous behavior of double-quiescent elementary cellular automata. Theor. Comput. Sci. 362(1-3): 1-16 (2006) - [c8]Nazim Fatès:
Directed Percolation Phenomena in Asynchronous Elementary Cellular Automata. ACRI 2006: 667-675 - [c7]Nazim Fatès, Damien Regnault, Nicolas Schabanel, Eric Thierry:
Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata. LATIN 2006: 455-466 - 2005
- [j1]Nazim Fatès, Michel Morvan:
An Experimental Study of Robustness to Asynchronism for Elementary Cellular Automata. Complex Syst. 16(1) (2005) - [c6]Nazim Fatès, Michel Morvan, Nicolas Schabanel, Eric Thierry:
Fully Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata. MFCS 2005: 316-327 - 2004
- [c5]Nazim Fatès, Michel Morvan:
Perturbing the Topology of the Game of Life Increases Its Robustness to Asynchrony. ACRI 2004: 111-120 - 2003
- [c4]Nazim Fatès:
Experimental study of Elementary Cellular Automata dynamics using the density parameter. DMCS 2003: 155-166 - 2001
- [c3]Martin Steinebach, Jana Dittmann, Christian Seibel, Lucilla Croce Ferri, Fabien A. P. Petitcolas, Nazim Fatès, Caroline Fontaine, Frédéric Raynal:
StirMark Benchmark: Audio Watermarking Attacks. ITCC 2001: 49-54 - [c2]Fabien A. P. Petitcolas, Martin Steinebach, Frédéric Raynal, Jana Dittmann, Caroline Fontaine, Nazim Fatès:
Public automated web-based evaluation service for watermarking schemes: StirMark benchmark. Security and Watermarking of Multimedia Contents 2001: 575-584 - 2000
- [c1]Nazim Fatès, Fabien A. P. Petitcolas:
Watermarking scheme evaluation tool. ISMSE 2000: 328-331
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint