Massively parallel automata in Euclidean space time

Massively parallel automata in Euclidean space-time Massively parallel automata in Euclidean space-time Denys Duchier 1 , Jérôme Durand-Lose 2 , Maxime Senot 2 1 Team Constraint & Machine Learning 2 Team Graphs & Algorithms September 27 th 2010 SCW'10, Budapest

• signal machines


• synchronization problem


• team graphs


• firing squad


• goto's solution


• euclidean space-time


• massively parallel