A brief history of cellular automata
ACM Computing Surveys (CSUR)
Smaller solutions for the firing squad
Theoretical Computer Science
Bounding the firing synchronization problem on a ring
Theoretical Computer Science
Closure properties of cellular automata
Theoretical Computer Science
Low complexity classes of multidimensional cellular automata
Theoretical Computer Science
On the complexity of the “most general” firing squad synchronization problem
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
On formulations of firing squad synchronization problems
UC'05 Proceedings of the 4th international conference on Unconventional Computation
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Synchronization of a Line of Identical Processors at a Given Time
Fundamenta Informaticae
A padding technique on cellular automata to transfer inclusions of complexity classes
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
The firing squad synchronization problem with sub-generals
Information Processing Letters
| Hi-index | 0.90 |