Name
Papers
Collaborators
ALBERTO DENNUNZIO
63
34
Citations 
PageRank 
Referers 
318
38.17
208
Referees 
References 
226
451
Search Limit
100226
Title
Citations
PageRank
Year
An efficiently computable characterization of stability and instability for linear cellular automata00.342021
Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption00.342021
From Linear to Additive Cellular Automata.00.342020
Dynamical Behavior of Additive Cellular Automata over Finite Abelian Groups00.342020
Chaos and ergodicity are decidable for linear cellular automata over (Z/mZ)n00.342020
Search space reduction of asynchrony immune cellular automata00.342020
Search Space Reduction of Asynchrony Immune Cellular Automata by Center Permutivity.00.342019
Complexity of the dynamics of reaction systems.00.342019
Additive Cellular Automata Over Finite Abelian Groups - Topological and Measure Theoretic Properties.00.342019
On the dynamical behaviour of linear higher-order cellular automata and its decidability.00.342019
Solving Equations on Discrete Dynamical Systems.00.342019
Decidability of Sensitivity and Equicontinuity for Linear Higher-Order Cellular Automata.00.342019
Polynomial Equations over Finite, Discrete-Time Dynamical Systems.00.342018
Computing the periods of preimages in surjective cellular automata.10.362017
Computational complexity of finite asynchronous cellular automata10.372017
Reachability in Resource-Bounded Reaction Systems.10.382016
Ancestors, descendants, and gardens of Eden in reaction systems30.462015
Foreword: asynchronous behavior of cellular automata and discrete models00.342015
Preimage Problems for Reaction Systems.10.382015
Reaction systems and extremal combinatorics properties10.382015
Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues140.762014
Three research directions in non-uniform cellular automata.20.362014
Non Uniform Cellular Automata Description Of Signed Partition Versions Of Ice And Sand Pile Models50.432014
Extremal Combinatorics of Reaction Systems.00.342014
Limit Properties of Doubly Quiescent m-Asynchronous Elementary Cellular Automata.10.362014
Surjective multidimensional cellular automata are non-wandering: A combinatorial proof60.472013
Local rule distributions, language complexity and non-uniform cellular automata70.472013
m-Asynchronous cellular automata: from fairness to quasi-fairness120.682013
Foreword: asynchronous cellular automata and applications10.352013
Unconventional Computation and Natural Computation - 12th International Conference, UCNC 2013, Milan, Italy, July 1-5, 2013. Proceedings305.152013
Periodic Orbits and Dynamical Complexity in Cellular Automata70.492013
Acceptance conditions for omega-languages and the Borel hierarchy.10.372013
Foreword: cellular automata and applications00.342013
M-Asynchronous Cellular Automata10.382012
Strictly Temporally Periodic Points In Cellular Automata10.382012
Acceptance conditions for ω-languages30.442012
Computational complexity of rule distributions of non-uniform cellular automata40.562012
From One-dimensional to Two-dimensional Cellular Automata60.482012
Computing Issues of Asynchronous CA90.652012
Foreword: asynchronous cellular automata and nature-inspired computation00.342012
Computational Aspects of Asynchronous CA00.342011
Asymptotic distribution of entry times in a cellular automaton with annihilating particles.30.542011
Non-uniform cellular automata and distributions of rules10.342011
Non-uniform cellular automata: Classes, dynamics, and decidability180.982011
Computational aspects of asynchronous cellular automata10.372011
Conservation of some dynamical properties for operations on cellular automata251.262009
Sand automata as cellular automata221.292009
Non-uniform Cellular Automata140.852009
2D cellular automata: expansivity and decidability issues00.342009
A compact topology for sand automata10.392008
  • 1
  • 2