The correctness proof of Ben-Or's randomized consensus algorithm (Q1938380): Difference between revisions

@@ Property / DOI @@
-.1007/s00446-012-0162-z
@@ Property / DOI: 10.1007/s00446-012-0162-z / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W1967908173
@@ Property / OpenAlex ID: W1967908173 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549610
@@ Property / cites work: Q3549610 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Randomized Consensus under a Weak Adversary
+Normal rank
@@ Property / cites work @@
+Fast randomized consensus using shared memory
@@ Property / cites work: Fast randomized consensus using shared memory / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers
+Normal rank
@@ Property / cites work @@
+The correctness proof of Ben-Or's randomized consensus algorithm
+Normal rank
@@ Property / cites work @@
+Impossibility of distributed consensus with one faulty process
+Normal rank
@@ Property / cites work @@
+Linearizable implementations do not suffice for randomized distributed computation
+Normal rank
@@ Property / cites work @@
+Q3126969
@@ Property / cites work: Q3126969 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00446-012-0162-Z
@@ Property / DOI: 10.1007/S00446-012-0162-Z / rank @@
+Normal rank