The Failure Discovery problem (Q4031322): Difference between revisions

@@ Property / cites work @@
+On the message complexity of binary Byzantine agreement under crash failures
+Normal rank
@@ Property / cites work @@
+Are wait-free algorithms fast?
@@ Property / cites work: Are wait-free algorithms fast? / rank @@
+Normal rank
@@ Property / cites work @@
+Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
+Normal rank
@@ Property / cites work @@
+Unreliable failure detectors for asynchronous systems (preliminary version)
+Normal rank
@@ Property / cites work @@
+The Byzantine generals strike again
@@ Property / cites work: The Byzantine generals strike again / rank @@
+Normal rank
@@ Property / cites work @@
+Q3666268
@@ Property / cites work: Q3666268 / rank @@
+Normal rank
@@ Property / cites work @@
+Message-optimal protocols for Byzantine Agreement
@@ Property / cites work: Message-optimal protocols for Byzantine Agreement / rank @@
+Normal rank
@@ Property / cites work @@
+Knowledge and common knowledge in a distributed environment
+Normal rank
@@ Property / cites work @@
+The Weak Byzantine Generals Problem
@@ Property / cites work: The Weak Byzantine Generals Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Byzantine Generals Problem
@@ Property / cites work: The Byzantine Generals Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time
+Normal rank
@@ Property / cites work @@
+Automatically increasing the fault-tolerance of distributed algorithms
+Normal rank
@@ Property / cites work @@
+Reaching Agreement in the Presence of Faults
@@ Property / cites work: Reaching Agreement in the Presence of Faults / rank @@
+Normal rank
@@ Property / cites work @@
+Using process groups to implement failure detection in asynchronous environments
+Normal rank