A brief history of cellular automata
ACM Computing Surveys (CSUR)
Computing inside the billiard ball model
Collision-based computing
Efficient Universal Pushdown Cellular Automata and Their Application to Complexity
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
The complexity of reversible cellular automata
Theoretical Computer Science - Special issue: Theoretical aspects of cellular automata
How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme
Theoretical Computer Science - Special issue: Theoretical aspects of cellular automata
Fast reversible language recognition using cellular automata
Information and Computation
Real-time reversible iterative arrays
Theoretical Computer Science
On universality of radius 1/2 number-conserving cellular automata
UC'10 Proceedings of the 9th international conference on Unconventional computation
Theoretical Computer Science
Reversible conservative rational abstract geometrical computation is turing-universal
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Real-time reversible iterative arrays
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Hi-index | 0.89 |