Possibility and impossibility results in a shared memory environment (Q1901689): Difference between revisions

@@ Property / DOI @@
-.1007/s002360050034
@@ Property / DOI: 10.1007/s002360050034 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s002360050034
+Normal rank
@@ Property / OpenAlex ID @@
+W2023880298
@@ Property / OpenAlex ID: W2023880298 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3753476
@@ Property / cites work: Q3753476 / rank @@
+Normal rank
@@ Property / cites work @@
+How processes learn
@@ Property / cites work: How processes learn / rank @@
+Normal rank
@@ Property / cites work @@
+On the minimal synchronism needed for distributed consensus
+Normal rank
@@ Property / cites work @@
+Q3220545
@@ Property / cites work: Q3220545 / rank @@
+Normal rank
@@ Property / cites work @@
+Impossibility of distributed consensus with one faulty process
+Normal rank
@@ Property / cites work @@
+Leader election in the presence of n-1 initial failures
+Normal rank
@@ Property / cites work @@
+Impossibility results in the presence of multiple faulty processes
+Normal rank
@@ Property / cites work @@
+Initial failures in distributed computations
@@ Property / cites work: Initial failures in distributed computations / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S002360050034
@@ Property / DOI: 10.1007/S002360050034 / rank @@
+Normal rank