Eric Goles
type: Item
instance of: scholarly article
title: Eric Goles
DOI: 10.1007/978-3-030-92551-2_1
author: Andrew Adamatzky
publication date: 2022-10-25T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7607357
MaRDI profile type: Publication
full work available at URL: 978-3-030-92551-2 1
OpenAlex ID: W4226158512
cites work: Parallel chip firing games on graphs
cites work: Computational Complexity of Biased Diffusion-Limited Aggregation
cites work: Dynamics of positive automata networks
cites work: Symmetric discrete universal neural networks
cites work: Dynamics of neural networks over undirected graphs
cites work: A characterization of the existence of energies for neural networks
cites work: Q3821596
cites work: Tiling with bars under tomographic constraints.
cites work: Specific roles of the different Boolean mappings in random networks
cites work: Q3363205
cites work: Computational complexity of avalanches in the Kadanoff sandpile model
cites work: UNIVERSAL CELLULAR AUTOMATON OVER A HEXAGONAL TILING WITH 3 STATES
cites work: Crossing information in two-dimensional sandpiles
cites work: Dynamics of a class of ants on a one-dimensional lattice
cites work: Q2762789
cites work: Complexity of Langton's ant
cites work: Reaction-diffusion automata: Three states implies universality
cites work: Communication complexity in number-conserving and monotone cellular automata
cites work: Fixed Point Behavior of Threshold Functions on a Finite Set
cites work: Antisymmetrical neural networks
cites work: Q3988646
cites work: Folding and tiling
cites work: Combinatorial game associated to the one dimensional Schelling's model of social segregation
cites work: Games on line graphs and sand piles
cites work: Sandpile models and lattices: a comprehensive survey
cites work: Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol
cites work: On the limit set of some universal cellular automata
cites work: SAND PILE AS A UNIVERSAL COMPUTER
cites work: Universality of the chip-firing game
cites work: Q3350809
cites work: Lyapunov Functionals for Automata Networks Defined by Cyclically Monotone Functions
cites work: Q5145151
cites work: Deconstruction and dynamical robustness of regulatory networks: application to the yeast cell cycle networks
cites work: Computational complexity of threshold automata networks under different updating schemes
cites work: The complexity of the majority rule on planar graphs
cites work: On the complexity of two-dimensional signed majority cellular automata
cites work: On the impact of treewidth in the computational complexity of freezing dynamics
cites work: PSPACE-completeness of majority automata networks
cites work: The complexity of the bootstraping percolation and other problems
cites work: Q4912164
cites work: Lattice structure and convergence of a game of cards
cites work: Sandpiles and order structure of integer partitions
cites work: Periodic behaviour of generalized threshold functions
cites work: Comportement périodique des fonctions à seuil binaires et applications
cites work: Source reversal and chip firing on graphs
cites work: Tiling allowing rotations only
cites work: Iterative behaviour of generalized majority functions
cites work: Decreasing energy functions as a tool for studying threshold networks
cites work: No polynomial bound for the period of the parallel chip firing game on graphs
cites work: Self-organized societies: on the Sakoda model of social interactions
cites work: Dynamic models of segregation†
cites work: Balancing vectors in the max norm
cites work: Generation and robustness of Boolean networks to model \textit{Clostridium difficile} infection
cites work: Dynamics of extended Schelling models
description: scientific article; zbMATH DE number 7607357