A class of time-optimum FSSP algorithms for multi-dimensional cellular arrays (Q907212): Difference between revisions

@@ Property / cites work @@
+An 8-state minimal time solution to the firing squad synchronization problem
+Normal rank
@@ Property / cites work @@
+A six-state minimal time solution to the Firing squad synchronization problem
+Normal rank
@@ Property / cites work @@
+Q5586352
@@ Property / cites work: Q5586352 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4673398
@@ Property / cites work: Q4673398 / rank @@
+Normal rank
@@ Property / cites work @@
+Two- and three-dimensional firing-squad synchronization problems
+Normal rank
@@ Property / cites work @@
+Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position
+Normal rank
@@ Property / cites work @@
+Q5740434
@@ Property / cites work: Q5740434 / rank @@
+Normal rank
@@ Property / cites work @@
+Unconventional Computation
@@ Property / cites work: Unconventional Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Q3416102
@@ Property / cites work: Q3416102 / rank @@
+Normal rank
@@ Property / cites work @@
+A New Optimum-Time Firing Squad Synchronization Algorithm for Two-Dimensional Rectangle Arrays: One-Sided Recursive Halving Based
+Normal rank
@@ Property / cites work @@
+Q3603568
@@ Property / cites work: Q3603568 / rank @@
+Normal rank
@@ Property / cites work @@
+An optimum solution to the firing squad synchronization problem
+Normal rank