Cooperative computing with fragmentable and mergeable groups (Q1827289): Difference between revisions

@@ Property / cites work @@
+Performing tasks on synchronous restartable message-passing processors
+Normal rank
@@ Property / cites work @@
+Time-optimal message-efficient work performance in the presence of faults
+Normal rank
@@ Property / cites work @@
+Performing Work Efficiently in the Presence of Faults
+Normal rank
@@ Property / cites work @@
+Q4252758
@@ Property / cites work: Q4252758 / rank @@
+Normal rank
@@ Property / cites work @@
+Cooperative computing with fragmentable and mergeable groups
+Normal rank
@@ Property / cites work @@
+Q4344152
@@ Property / cites work: Q4344152 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic voting for consistent primary components
@@ Property / cites work: Dynamic voting for consistent primary components / rank @@
+Normal rank
@@ Property / cites work @@
+Q3126969
@@ Property / cites work: Q3126969 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3833630
@@ Property / cites work: Q3833630 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2766867
@@ Property / cites work: Q2766867 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138972
@@ Property / cites work: Q3138972 / rank @@
+Normal rank
@@ Property / cites work @@
+The Bancomat problem: An example of resource allocation in a partitionable asynchronous system
+Normal rank