An optimum-time square synchronization algorithm. One-sided recursive-halving marking based

MaRDI QIDQ5396378zbMATH OpenFDO

Authors Hiroki Uchino, Akira Nomura, Hiroshi Umeo

Publication date 5 February 2014

zbMATH Keywords

cellular automatonfiring squad synchronization problemtwo-dimensional square synchronization problem

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• A new optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays: one-sided recursive halving based
• A simple optimum-time FSSP algorithm for multi-dimensional cellular automata
• A new time-optimum synchronization algorithm for rectangle arrays
• An optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays
• Unconventional Computation

Cited in

(6)

• A simple optimum-time FSSP algorithm for multi-dimensional cellular automata
• scientific article; zbMATH DE number 2016494 (Why is no real title available?)
• Unconventional Computation
• A class of time-optimum FSSP algorithms for multi-dimensional cellular arrays
• THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS
• A new optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays: one-sided recursive halving based

This page was built for publication: An optimum-time square synchronization algorithm. One-sided recursive-halving marking based

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