Eric Goles
From MaRDI portal
Publication:2086708
DOI10.1007/978-3-030-92551-2_1OpenAlexW4226158512MaRDI QIDQ2086708
Publication date: 25 October 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-92551-2_1
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deconstruction and dynamical robustness of regulatory networks: application to the yeast cell cycle networks
- The complexity of the bootstraping percolation and other problems
- Computational complexity of threshold automata networks under different updating schemes
- Communication complexity in number-conserving and monotone cellular automata
- Reaction-diffusion automata: Three states implies universality
- Crossing information in two-dimensional sandpiles
- Dynamics of neural networks over undirected graphs
- PSPACE-completeness of majority automata networks
- Iterative behaviour of generalized majority functions
- Antisymmetrical neural networks
- Dynamics of positive automata networks
- Decreasing energy functions as a tool for studying threshold networks
- Balancing vectors in the max norm
- Periodic behaviour of generalized threshold functions
- Comportement périodique des fonctions à seuil binaires et applications
- Specific roles of the different Boolean mappings in random networks
- Parallel chip firing games on graphs
- On the limit set of some universal cellular automata
- Games on line graphs and sand piles
- Tiling allowing rotations only
- Complexity of Langton's ant
- Sandpiles and order structure of integer partitions
- No polynomial bound for the period of the parallel chip firing game on graphs
- Symmetric discrete universal neural networks
- Universality of the chip-firing game
- Lattice structure and convergence of a game of cards
- Tiling with bars under tomographic constraints.
- Source reversal and chip firing on graphs
- Dynamics of a class of ants on a one-dimensional lattice
- Folding and tiling
- Sandpile models and lattices: a comprehensive survey
- Self-organized societies: on the Sakoda model of social interactions
- On the impact of treewidth in the computational complexity of freezing dynamics
- The complexity of the majority rule on planar graphs
- On the complexity of two-dimensional signed majority cellular automata
- Dynamic models of segregation†
- Lyapunov Functionals for Automata Networks Defined by Cyclically Monotone Functions
- Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol
- SAND PILE AS A UNIVERSAL COMPUTER
- A characterization of the existence of energies for neural networks
- Fixed Point Behavior of Threshold Functions on a Finite Set
- UNIVERSAL CELLULAR AUTOMATON OVER A HEXAGONAL TILING WITH 3 STATES
- Computational Complexity of Biased Diffusion-Limited Aggregation
- Dynamics of extended Schelling models
- Combinatorial game associated to the one dimensional Schelling's model of social segregation
- Generation and robustness of Boolean networks to model \textit{Clostridium difficile} infection
This page was built for publication: Eric Goles
