Faster computation on directed networks of automata
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
The wake up and report problem is time-equivalent to the firing squad synchronization problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
ACRI '01 Proceedings of the 5th International Conference on Cellular Automata for Research and Industry
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
On the complexity of the "most general" undirected firing squad synchronization problem
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
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
On the complexity of network synchronization
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Dynamic neighbourhood cellular automata
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Cellular automata models for complex matter
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
| Hi-index | 0.01 |