Nazim Fatès - RankMe

66 papers A 3B 4C 2Journal 24Unranked 28

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Regional controllability of cellular automata as a SAT problem. Nat. Comput. Franco Bagnoli, Sara Dridi, Nazim Fatès
2024	—	`conf`	Asynchronous Cellular Systems that Solve the Parity Problem. AUTOMATA Nazim Fatès
2024	J	`jnl`	Reversibility of elementary cellular automata with fully asynchronous updating: An analysis of the rules with partial recurrence. Theor. Comput. Sci. Souvik Roy, Nazim Fatès, Sukanta Das
2023	—	`conf`	A Decentralised Diagnosis Method with Probabilistic Cellular Automata. AUTOMATA Nazim Fatès, Régine Marchand, Irène Marcovici
2023	—	`conf`	Properties of B2B Invoice Graphs and Detection of Structures. COMPLEX NETWORKS (3) Joannès Guichon, Nazim Fatès, Sylvain Contassot-Vivier, Massimo Amato
2023	—	`book`	Robustesse des systèmes complexes : étude du rôle de l'aléa dans la dynamique des automates cellulaires. Nazim Fatès
2022	—	`conf`	Amoebae for Clustering: A Bio-Inspired Cellular Automata Method for Data Classification. Automata and Complexity Amaury Saint-Jore, Nazim Fatès, Emmanuel Jeandel
2022	J	`jnl`	Self-stabilisation of Cellular Automata on Tilings. Fundam. Informaticae Nazim Fatès, Irène Marcovici, Siamak Taati
2021	J	`jnl`	Self-stabilisation of cellular automata on tilings. CoRR Nazim Fatès, Irène Marcovici, Siamak Taati
2020	J	`jnl`	A tutorial on elementary cellular automata with fully asynchronous updating. Nat. Comput. Nazim Fatès
2019	—	`conf`	Cellular Automata for the Self-stabilisation of Colourings and Tilings. RP Nazim Fatès, Irène Marcovici, Siamak Taati
2019	—	`conf`	Diagnostic décentralisé à l'aide d'automates cellulaires. JFSMA Nicolas Gauville, Nazim Fatès, Irène Marcovici
2019	J	`jnl`	Remarks on the cellular automaton global synchronisation problem: deterministic versus stochastic models. Nat. Comput. Nazim Fatès
2018	—	`conf`	A Pedagogical Example: A Family of Stochastic Cellular Automata that Plays Alesia. ACRI Nazim Fatès
2018	—	`ch.`	On the Reversibility of ECAs with Fully Asynchronous Updating: The Recurrence Point of View. Reversibility and Universality Nazim Fatès, Biswanath Sethi, Sukanta Das
2017	—	`conf`	Diploid Cellular Automata: First Experiments on the Random Mixtures of Two Elementary Rules. AUTOMATA Nazim Fatès
2016	—	`conf`	Collective Infotaxis with Reactive Amoebae: A Note on a Simple Bio-inspired Mechanism. ACRI Nazim Fatès
2016	—	`conf`	Two-Dimensional Traffic Rules and the Density Classification Problem. Automata Nazim Fatès, Irène Marcovici, Siamak Taati
2015	J	`jnl`	Introduction. Tech. Sci. Informatiques Nazim Fatès, Sylvain Sené
2015	J	`jnl`	Local structure approximation as a predictor of second-order phase transitions in asynchronous cellular automata. Nat. Comput. Henryk Fuks, Nazim Fatès
2015	—	`conf`	Remarks on the Cellular Automaton Global Synchronisation Problem. Automata Nazim Fatès
2014	J	`jnl`	A Guided Tour of Asynchronous Cellular Automata. J. Cell. Autom. Nazim Fatès
2014	—	`conf`	Bifurcations of Local Structure Maps as Predictors of Phase Transitions in Asynchronous Cellular Automata. ACRI Henryk Fuks, Nazim Fatès
2014	—	`conf`	Quick Convergence to a Fixed Point: A Note on Asynchronous Elementary Cellular Automata. ACRI Nazim Fatès
2014	C	`conf`	Reversibility of Elementary Cellular Automata under Fully Asynchronous Update. TAMC Biswanath Sethi, Nazim Fatès, Sukanta Das
2013	—	`conf`	A Guided Tour of Asynchronous Cellular Automata. Automata Nazim Fatès
2013	—	`conf`	A Note on the Classification of the Most Simple Asynchronous Cellular Automata. Automata Nazim Fatès
2013	—	`conf`	A Robustness Approach to Study Metastable Behaviours in a Lattice-Gas Model of Swarming. Automata Olivier Bouré, Nazim Fatès, Vincent Chevrier
2013	J	`jnl`	First steps on asynchronous lattice-gas models with an application to a swarming rule. Nat. Comput. Olivier Bouré, Nazim Fatès, Vincent Chevrier
2013	J	`jnl`	Foreword: asynchronous cellular automata and applications. Nat. Comput. Alberto Dennunzio, Nazim Fatès, Enrico Formenti
2013	J	`jnl`	Stochastic Cellular Automata Solutions to the Density Classification Problem - When Randomness Helps Computing. Theory Comput. Syst. Nazim Fatès
2012	J	`jnl`	A Robust Scheme for Aggregating Quasi-Blind Robots in an Active Environment. Int. J. Swarm Intell. Res. Nazim Fatès, Nikolaos Vlassopoulos
2012	B	`conf`	Density Classification on Infinite Lattices and Trees. LATIN Ana Busic, Nazim Fatès, Jean Mairesse, Irène Marcovici
2012	—	`conf`	First Steps on Asynchronous Lattice-Gas Models with an Application to a Swarming Rule. ACRI Olivier Bouré, Nazim Fatès, Vincent Chevrier
2012	J	`jnl`	Large-scale Simulations on FPGAs: Finding the Asymptotic Critical Threshold of the Greenberg-Hastings Cellular Automata. J. Cell. Autom. Nikolaos Vlassopoulos, Nazim Fatès, Hugues Berry, Bernard Girau
2012	J	`jnl`	Preface. J. Cell. Autom. Nazim Fatès
2012	J	`jnl`	Probing robustness of cellular automata through variations of asynchronous updating. Nat. Comput. Olivier Bouré, Nazim Fatès, Vincent Chevrier
2012	J	`jnl`	Robustness of Multi-agent Models: The Example of Collaboration between Turmites with Synchronous and Asynchronous Updating. Complex Syst. Selma Belgacem, Nazim Fatès
2011	—	`ed.`	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 Automata Nazim Fatès, Eric Goles Chacc, Alejandro Maass, Ivan Rapaport
2011	—	`conf`	Clustering behavior of a bio-inspired decentralized aggregation scheme. ECAL Nikolaos Vlassopoulos, Nazim Fatès
2011	J	`jnl`	Density classification on infinite lattices and trees CoRR Ana Busic, Nazim Fatès, Jean Mairesse, Irène Marcovici
2011	C	`conf`	Robustness of Cellular Automata in the Light of Asynchronous Information Transmission. UC Olivier Bouré, Nazim Fatès, Vincent Chevrier
2011	J	`jnl`	Robustness of the Critical Behaviour in the Stochastic Greenberg-Hastings Cellular Automaton Model Int. J. Unconv. Comput. Hugues Berry, Nazim Fatès
2011	A	`conf`	Stochastic Cellular Automata Solve the Density Classification Problem with an Arbitrary Precision. STACS Nazim Fatès
2010	—	`conf`	An FPGA design for the stochastic Greenberg-Hastings cellular automata. HPCS Nikolaos Vlassopoulos, Nazim Fatès, Hugues Berry, Bernard Girau
2010	—	`ed.`	Automata 2010 - 16th Intl. Workshop on CA and DCS, Nancy, France, June 14-16, 2010 Automata Nazim Fatès, Jarkko Kari, Thomas Worsch
2010	A	`conf`	Brothers in Arms? On AI Planning and Cellular Automata. ECAI Jörg Hoffmann, Nazim Fatès, Héctor Palacios
2010	—	`ch.`	Does Game of Life Cellular Automata Nazim Fatès
2010	A	`conf`	How important are updating schemes in multi-agent systems? An illustration on a multi-turmite model. AAMAS Nazim Fatès, Vincent Chevrier
2010	J	`jnl`	Solving the decentralised gathering problem with a reaction-diffusion-chemotaxis scheme. Swarm Intell. Nazim Fatès
2009	J	`jnl`	Asynchronism Induces Second-Order Phase Transitions in Elementary Cellular Automata. J. Cell. Autom. Nazim Fatès
2009	J	`jnl`	Examples of Fast and Slow Convergence of 2D Asynchronous Cellular Systems. J. Cell. Autom. Nazim Fatès, Lucas Gerin
2009	B	`conf`	From Reactive Multi-Agents Models to Cellular Automata - Illustration on a Diffusion-Limited Aggregation Model. ICAART Antoine Spicher, Nazim Fatès, Olivier Simonin
2009	—	`conf`	Robustness of the Critical Behaviour in a Discrete Stochastic Reaction-Diffusion Medium. IWNC Nazim Fatès, Hugues Berry
2009	—	`conf`	Translating Discrete Multi-Agents Systems into Cellular Automata: Application to Diffusion-Limited Aggregation. ICAART (Revised Selected Papers) Antoine Spicher, Nazim Fatès, Olivier Simonin
2008	—	`conf`	Examples of Fast and Slow Convergence of 2D Asynchronous Cellular Systems. ACRI Nazim Fatès, Lucas Gerin
2006	B	`conf`	Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata. LATIN Nazim Fatès, Damien Regnault, Nicolas Schabanel, Eric Thierry
2006	—	`conf`	Directed Percolation Phenomena in Asynchronous Elementary Cellular Automata. ACRI Nazim Fatès
2006	J	`jnl`	Fully asynchronous behavior of double-quiescent elementary cellular automata. Theor. Comput. Sci. Nazim Fatès, Eric Thierry, Michel Morvan, Nicolas Schabanel
2005	J	`jnl`	An Experimental Study of Robustness to Asynchronism for Elementary Cellular Automata. Complex Syst. Nazim Fatès, Michel Morvan
2005	B	`conf`	Fully Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata. MFCS Nazim Fatès, Michel Morvan, Nicolas Schabanel, Eric Thierry
2004	—	`conf`	Perturbing the Topology of the Game of Life Increases Its Robustness to Asynchrony. ACRI Nazim Fatès, Michel Morvan
2003	—	`conf`	Experimental study of Elementary Cellular Automata dynamics using the density parameter. DMCS Nazim Fatès
2001	—	`conf`	Public automated web-based evaluation service for watermarking schemes: StirMark benchmark. Security and Watermarking of Multimedia Contents Fabien A. P. Petitcolas, Martin Steinebach, Frédéric Raynal, Jana Dittmann, Caroline Fontaine, Nazim Fatès
2001	—	`conf`	StirMark Benchmark: Audio Watermarking Attacks. ITCC Martin Steinebach, Jana Dittmann, Christian Seibel, Lucilla Croce Ferri, Fabien A. P. Petitcolas, Nazim Fatès, Caroline Fontaine, Frédéric Raynal
2000	—	`conf`	Watermarking scheme evaluation tool. ISMSE Nazim Fatès, Fabien A. P. Petitcolas