Automata networks, and in particular Boolean networks, are used to model...
The simple greedy algorithm to find a maximal independent set of a graph...
The domatic number of a graph is the maximum number of vertex disjoint
d...
The weight distribution of an error correcting code is a crucial statist...
Finite dynamical systems (FDSs) are commonly used to model systems with ...
We present a construction of partial spread bent functions using subspac...
The degree-based entropy of a graph is defined as the Shannon entropy ba...
Space-filling curves (SFCs) are used in high performance computing to
di...
Automata networks are mappings of the form f : Q Z → Q Z , where
Q is a ...
Latin squares and hypercubes are combinatorial designs with several
appl...
An automata network is a finite graph where each node holds a state from...
An automata network is a finite graph where each node holds a state from...
As the engineering endeavour to realise quantum computers progresses, we...
In this paper, we introduce a new kind of duality for Linear Programming...
We investigate sets of Mutually Orthogonal Latin Squares (MOLS) generate...
An Automata Network is a map f:Q^n→ Q^n where Q is a finite
alphabet. It...
A finite dynamical system (FDS) is a system of multivariate functions ov...
The asynchronous dynamics associated with a Boolean network f : {0,1}^n
...
The asynchronous automaton associated with a Boolean network
f:{0,1}^n→{...