Faster synchronization in P systems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2163014 (Why is no real title available?)
- scientific article; zbMATH DE number 1886326 (Why is no real title available?)
- A six-state minimal time solution to the Firing squad synchronization problem
- An 8-state minimal time solution to the firing squad synchronization problem
- An optimum solution to the firing squad synchronization problem
- HOW TO SYNCHRONIZE THE ACTIVITY OF ALL COMPONENTS OF A P SYSTEM?
- Network structure and the firing squad synchronization problem
- P systems and the Byzantine agreement
- The firing squad synchronization problem for graphs
- Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position
- Unconventional Computation
Cited in
(9)- Synchronization of rules in membrane computing
- Fast Synchronization in P Systems
- P systems and the Byzantine agreement
- On the efficiency of synchronized P systems
- HOW TO SYNCHRONIZE THE ACTIVITY OF ALL COMPONENTS OF A P SYSTEM?
- Synchronization in P modules
- Parallel and distributed algorithms in P systems
- An adaptive algorithm for P system synchronization
- The power of synchronizing rules in membrane computing
This page was built for publication: Faster synchronization in P systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761716)
