Pages that link to "Item:Q850771"
From MaRDI portal
The following pages link to On the use of cellular automata in symmetric cryptography (Q850771):
Displaying 14 items.
- Predecessors and Garden-of-Eden configurations in parallel dynamical systems on maxterm and minterm Boolean functions (Q1757346) (← links)
- Solution to the predecessors and gardens-of-Eden problems for synchronous systems over directed graphs (Q2008486) (← links)
- A closed formula for the inverse of a reversible cellular automaton with \((2 R + 1)\)-cyclic rule (Q2009571) (← links)
- On the periods of parallel dynamical systems (Q2012836) (← links)
- Enumerating periodic orbits in sequential dynamical systems over graphs (Q2068626) (← links)
- On the dynamics of semilattice networks (Q2133914) (← links)
- Maximum number of periodic orbits in parallel dynamical systems (Q2200630) (← links)
- Counting periodic points in parallel graph dynamical systems (Q2210298) (← links)
- Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs (Q2246963) (← links)
- Dynamical attraction in parallel network models (Q2279655) (← links)
- On periods and equilibria of computational sequential systems (Q2293262) (← links)
- Predecessors existence problems and Gardens of Eden in sequential dynamical systems (Q2325175) (← links)
- Parallel dynamical systems over graphs and related topics: a survey (Q2336941) (← links)
- Symmetrizable Boolean networks (Q6496146) (← links)
