Elements of a theory of computer simulation. I
From MaRDI portal
(Redirected from Publication:1294327)
Recommendations
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 107541 (Why is no real title available?)
- scientific article; zbMATH DE number 568838 (Why is no real title available?)
- scientific article; zbMATH DE number 3443655 (Why is no real title available?)
- scientific article; zbMATH DE number 781092 (Why is no real title available?)
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A unifying framework for distributed simulation
- Acyclic orientations of graphs
- Almost all regular graphs are Hamiltonian
- Combinatorial problems of commutation and rearrangements
- Combinatorics on traces
- Computation theory of cellular automata
- Generic properties of combinatory maps: Neutral networks of RNA secondary structures
- Graph Theory and Probability
- Limit distribution for the existence of Hamiltonian cycles in a random graph
- The enumeration of Coxeter elements
- The firing squad synchronization problem on Cayley graphs
Cited in
(46)- Dynamical attraction in parallel network models
- Indiscernibility structures induced from function sets: graph and digraph case
- D-chain tomography of networks: a new structure spectrum and an application to the SIR process
- On the dynamics of semilattice networks
- The adjacency matrix of a graph as a data table: a geometric perspective
- A new discrete dynamical system of signed integer partitions
- Computation of functions on n bits by asynchronous clocking of cellular automata
- Updating method for the computation of orbits in parallel and sequential dynamical systems
- Acyclic orientations of random graphs
- Friends and strangers walking on graphs
- Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions
- Synchronous and asynchronous evaluation of dynamic neural fields
- Agent-based modeling, mathematical formalism for
- Equivalence relations on finite dynamical systems
- Flexible toggles and symmetric invertible asynchronous elementary cellular automata
- Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs
- Sequential dynamical systems over words
- Predecessors and Garden-of-Eden configurations in parallel dynamical systems on maxterm and minterm Boolean functions
- Threshold agent networks: An approach to modelling and simulation
- Causal graph dynamics
- Dependency and accuracy measures for directed graphs
- Elements of a theory of simulation. II: Sequential dynamical systems.
- The domination numbers of cylindrical grid graphs
- ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS
- Matrix method for linear sequential dynamical systems on digraphs
- Parallel and sequential dynamics of two discrete models of signed integer partitions
- Linear sequential dynamical systems, incidence algebras, and Möbius functions
- Elements of a theory of simulation. III: Equivalence of SDS.
- ETS IV: Sequential dynamical systems: fixed points, invertibility and equivalence
- Discrete dynamical systems on graphs and Boolean functions
- On acyclic orientations and sequential dynamical systems
- Parallel discrete dynamical systems on maxterm and minterm Boolean functions
- On the diameters of friends-and-strangers graphs
- On periods and equilibria of computational sequential systems
- Parallel dynamical systems over graphs and related topics: a survey
- Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems
- Parallel dynamical systems over directed dependency graphs
- Update schedules of sequential dynamical systems
- A graph-dynamical interpretation of Kiselman's semigroups
- Complexity of reachability problems for finite discrete dynamical systems
- Enumerating periodic orbits in sequential dynamical systems over graphs
- Attractors and transient in sequential dynamical systems
- Dichotomy results for fixed point counting in Boolean dynamical systems
- Decomposition and simulation of sequential dynamical systems
- Parallel dynamical systems over special digraph classes
- Lipschitz continuity under toric equivalence for asynchronous Boolean networks
This page was built for publication: Elements of a theory of computer simulation. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294327)
