A brief history of cellular automata
ACM Computing Surveys (CSUR)
Cellular automata and intermediate reachability problems
Fundamenta Informaticae - Special issue on cellular automata
Computing inside the billiard ball model
Collision-based computing
Analysis Problems for Sequential Dynamical Systems and Communicating State Machines
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
CG '00 Revised Papers from the Second International Conference on Computers and Games
Reachability problems for sequential dynamical systems with threshold functions
Theoretical Computer Science - Mathematical foundations of computer science
On Counting Fixed Point Configurations in Star Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09
Complexity of reachability problems for finite discrete dynamical systems
Journal of Computer and System Sciences
Predecessor existence problems for finite discrete dynamical systems
Theoretical Computer Science
The general σ all-ones problem for trees
Discrete Applied Mathematics
Computational aspects of analyzing social network dynamics
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems
Theoretical Computer Science
On computational complexity of counting fixed points in symmetric boolean graph automata
UC'05 Proceedings of the 4th international conference on Unconventional Computation
Cellular Automata and Intermediate Reachability Problems
Fundamenta Informaticae - Cellular Automata
| Hi-index | 0.00 |