Eric Goles
From MaRDI portal
Publication:2086708
Cites work
- A characterization of the existence of energies for neural networks
- Antisymmetrical neural networks
- Balancing vectors in the max norm
- Combinatorial game associated to the one dimensional Schelling's model of social segregation
- Communication complexity in number-conserving and monotone cellular automata
- Communications in cellular automata
- Complexity of Langton's ant
- Comportement périodique des fonctions à seuil binaires et applications
- Computational complexity of avalanches in the Kadanoff sandpile model
- Computational Complexity of Biased Diffusion-Limited Aggregation
- Computational complexity of threshold automata networks under different updating schemes
- Crossing information in two-dimensional sandpiles
- Deconstruction and dynamical robustness of regulatory networks: application to the yeast cell cycle networks
- Decreasing energy functions as a tool for studying threshold networks
- Dynamic models of segregation†
- Dynamics of a class of ants on a one-dimensional lattice
- Dynamics of extended Schelling models
- Dynamics of neural networks over undirected graphs
- Dynamics of positive automata networks
- Energy functions in neural networks with continuous local functions
- Fixed Point Behavior of Threshold Functions on a Finite Set
- Folding and tiling
- Games on line graphs and sand piles
- Generation and robustness of Boolean networks to model \textit{Clostridium difficile} infection
- scientific article; zbMATH DE number 1689044 (Why is no real title available?)
- scientific article; zbMATH DE number 4201673 (Why is no real title available?)
- scientific article; zbMATH DE number 4094827 (Why is no real title available?)
- scientific article; zbMATH DE number 32904 (Why is no real title available?)
- Iterative behaviour of generalized majority functions
- Lattice structure and convergence of a game of cards
- Lyapunov Functionals for Automata Networks Defined by Cyclically Monotone Functions
- No polynomial bound for the period of the parallel chip firing game on graphs
- Number-conserving cellular automata and communication complexity: a numerical exploration beyond elementary CAs
- On the complexity of two-dimensional signed majority cellular automata
- On the impact of treewidth in the computational complexity of freezing dynamics
- On the limit set of some universal cellular automata
- Parallel chip firing games on graphs
- Periodic behaviour of generalized threshold functions
- PSPACE-completeness of majority automata networks
- Reaction-diffusion automata: Three states implies universality
- SAND PILE AS A UNIVERSAL COMPUTER
- Sandpile models and lattices: a comprehensive survey
- Sandpiles and order structure of integer partitions
- Self-organized societies: on the Sakoda model of social interactions
- Source reversal and chip firing on graphs
- Specific roles of the different Boolean mappings in random networks
- Symmetric discrete universal neural networks
- The complexity of the bootstraping percolation and other problems
- The complexity of the majority rule on planar graphs
- Tiling allowing rotations only
- Tiling with bars under tomographic constraints.
- Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol
- UNIVERSAL CELLULAR AUTOMATON OVER A HEXAGONAL TILING WITH 3 STATES
- Universality of the chip-firing game
This page was built for publication: Eric Goles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2086708)
