The Contest between Simplicity and Efficiency in Asynchronous Byzantine Agreement (Q3095337): Difference between revisions

@@ Property / cites work @@
+Lower bounds for randomized consensus under a weak adversary
+Normal rank
@@ Property / cites work @@
+A tight lower bound for randomized synchronous consensus
+Normal rank
@@ Property / cites work @@
+Byzantine agreement in the full-information model in O(log n) rounds
+Normal rank
@@ Property / cites work @@
+Impossibility of distributed consensus with one faulty process
+Normal rank
@@ Property / cites work @@
+Q3579423
@@ Property / cites work: Q3579423 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast asynchronous Byzantine agreement and leader election with full information
+Normal rank
@@ Property / cites work @@
+From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits
+Normal rank
@@ Property / cites work @@
+Breaking the             <i>O</i>             (             <i>n</i>             <sup>2</sup>             ) bit barrier
+Normal rank
@@ Property / cites work @@
+Scalable leader election
@@ Property / cites work: Scalable leader election / rank @@
+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