Mutual exclusion in fully anonymous shared memory systems (Q2308458): Difference between revisions

@@ Property / cites work @@
+Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion
+Normal rank
@@ Property / cites work @@
+Computing in totally anonymous asynchronous shared memory systems
+Normal rank
@@ Property / cites work @@
+On the Existence of Weakest Failure Detectors for Mutual Exclusion and k-Exclusion
+Normal rank
@@ Property / cites work @@
+Anonymous asynchronous systems: the case of failure detectors
+Normal rank
@@ Property / cites work @@
+Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers
+Normal rank
@@ Property / cites work @@
+Anonymous Read/write memory: leader election and de-anonymization
+Normal rank
@@ Property / cites work @@
+Anonymous and fault-tolerant shared-memory computing
+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 @@
+Myths about the mutual exclusion problem
@@ Property / cites work: Myths about the mutual exclusion problem / rank @@
+Normal rank
@@ Property / cites work @@
+The choice coordination problem
@@ Property / cites work: The choice coordination problem / rank @@
+Normal rank
@@ Property / cites work @@
+Concurrent Programming: Algorithms, Principles, and Foundations
+Normal rank
@@ Property / cites work @@
+Coordination Without Prior Agreement
@@ Property / cites work: Coordination Without Prior Agreement / rank @@
+Normal rank
@@ Property / cites work @@
+Set agreement power is not a precise characterization for oblivious deterministic anonymous objects
+Normal rank