A spatio-temporal algorithmic point of view on firing squad synchronisation problem

DOI10.1007/978-3-642-33350-7_11MaRDI QIDQ4649803zbMATH OpenOpenAlexFDO

Authors Luidnel Maignan, Jean-Baptiste Yunès

Publication date 14 November 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-33350-7_11

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4n-Steps Solution
• Smaller solutions for the firing squad
• Simple 8-state minimal time solution to the firing squad synchronization problem
• About 4-States Solutions to the Firing Squad Synchronization Problem
• scientific article; zbMATH DE number 4072387

Cited in

(6)

• Abstract geometrical computation. 11: Slanted firing squad synchronisation on signal machines
• scientific article; zbMATH DE number 5117093 (Why is no real title available?)
• Cutting the Firing Squad Synchronization
• Finitization of infinite field-based multi-general FSSP solution
• Generalized FSSP on hexagonal tiling: towards arbitrary regular spaces
• On time optimal solutions of the firing squad synchronization problem for two-dimensional paths

This page was built for publication: A spatio-temporal algorithmic point of view on firing squad synchronisation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649803)