Total ordering algorithms for asynchronous Byzantine systems (Q6084560): Difference between revisions

@@ Property / cites work @@
+Optimal amortized distributed consensus
@@ Property / cites work: Optimal amortized distributed consensus / rank @@
+Normal rank
@@ Property / cites work @@
+Consensus algorithms with one-bit messages
@@ Property / cites work: Consensus algorithms with one-bit messages / rank @@
+Normal rank
@@ Property / cites work @@
+Asynchronous byzantine agreement protocols
@@ Property / cites work: Asynchronous byzantine agreement protocols / rank @@
+Normal rank
@@ Property / cites work @@
+Asynchronous consensus and broadcast protocols
@@ Property / cites work: Asynchronous consensus and broadcast protocols / rank @@
+Normal rank
@@ Property / cites work @@
+Unreliable failure detectors for asynchronous systems (preliminary version)
+Normal rank
@@ Property / cites work @@
+The weakest failure detector for solving consensus
+Normal rank
@@ Property / cites work @@
+Impossibility of distributed consensus with one faulty process
+Normal rank
@@ Property / cites work @@
+Time, clocks, and the ordering of events in a distributed system
+Normal rank
@@ Property / cites work @@
+Asynchronous Fault-Tolerant Total Ordering 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 @@
+Fast Distributed Agreement
@@ Property / cites work: Fast Distributed Agreement / rank @@
+Normal rank