Symmetrizable Boolean networks

Cites Work

Unnamed Item
The complexity of the bootstraping percolation and other problems
Sand piles: from physics to cellular automata models
Computational complexity of threshold automata networks under different updating schemes
Boolean function complexity. Advances and frontiers.
On the use of cellular automata in symmetric cryptography
Antisymmetrical neural networks
Cellular automata as a paradigm for ecological modeling
Periodic behaviour of generalized threshold functions
Cellular automata model for the diffusion equation
No polynomial bound for the period of the parallel chip firing game on graphs
Linear sequential dynamical systems, incidence algebras, and Möbius functions
Dynamics of semilattice networks with strongly connected dependency graph
Discrete dynamical systems on graphs and Boolean functions
Parallel discrete dynamical systems on maxterm and minterm Boolean functions
On the periods of parallel dynamical systems
Counting periodic points in parallel graph dynamical systems
Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs
Binomial representation of cryptographic binary sequences and its relation to cellular automata
Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs
Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions
Steady State Analysis of Boolean Models
Neural networks and physical systems with emergent collective computational abilities.
A logical calculus of the ideas immanent in nervous activity
Dynamics of extended Schelling models

This page was built for publication: Symmetrizable Boolean networks