Unconventional Computation

DOI10.1007/11560319zbMATH Open1161.68609OpenAlexW4254053743MaRDI QIDQ5479216FDOQ5479216

Authors: Masaya Hisaoka, Shunsuke Akiguchi, Hiroshi Umeo 

Publication date: 7 July 2006

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

Full work available at URL: https://doi.org/10.1007/11560319

Recommendations

• A new time-optimum synchronization algorithm for rectangle arrays
• An optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays
• An optimum-time square synchronization algorithm. One-sided recursive-halving marking based
• A new optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays: one-sided recursive halving based
• A seven-state time-optimum square synchronizer

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cited In (11)

• Machines, Computations, and Universality
• An optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays
• Faster synchronization in P systems
• Title not available (Why is that?)
• Time-Optimum Smaller-State Synchronizers for Cellular Automata
• Two-dimensional cellular automata synchronizers
• A Design of Symmetrical Six-State 3n-Step Firing Squad Synchronization Algorithms and Their Implementations
• A class of time-optimum FSSP algorithms for multi-dimensional cellular arrays
• A new time-optimum synchronization algorithm for rectangle arrays
• A new optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays: one-sided recursive halving based
• A seven-state time-optimum square synchronizer

This page was built for publication: Unconventional Computation

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