The time complexity of updating snapshot memories (Q293175): Difference between revisions

@@ Property / cites work @@
+Composite registers
@@ Property / cites work: Composite registers / rank @@
+Normal rank
@@ Property / cites work @@
+Atomic snapshots of shared memory
@@ Property / cites work: Atomic snapshots of shared memory / rank @@
+Normal rank
@@ Property / cites work @@
+Atomic snapshots using lattice agreement
@@ Property / cites work: Atomic snapshots using lattice agreement / rank @@
+Normal rank
@@ Property / cites work @@
+Are wait-free algorithms fast?
@@ Property / cites work: Are wait-free algorithms fast? / rank @@
+Normal rank
@@ Property / cites work @@
+Atomic snapshots in <i>O(n</i> log <i>n)</i> operations
+Normal rank
@@ Property / cites work @@
+Time-Lapse Snapshots
@@ Property / cites work: Time-Lapse Snapshots / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal multi-writer multi-reader atomic register
@@ Property / cites work: Optimal multi-writer multi-reader atomic register / rank @@
+Normal rank
@@ Property / cites work @@
+The time complexity of updating snapshot memories
@@ Property / cites work: The time complexity of updating snapshot memories / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time snapshot implementations in unbalanced systems
+Normal rank
@@ Property / cites work @@
+On interprocess communication. I: Basic formalism
@@ Property / cites work: On interprocess communication. I: Basic formalism / rank @@
+Normal rank
@@ Property / cites work @@
+On interprocess communication. II: Algorithms
@@ Property / cites work: On interprocess communication. II: Algorithms / rank @@
+Normal rank