Modular construction of an efficient 1-bit Byzantine agreement protocol (Q4031323): Difference between revisions

@@ Property / cites work @@
+Consensus algorithms with one-bit messages
@@ Property / cites work: Consensus algorithms with one-bit messages / rank @@
+Normal rank
@@ Property / cites work @@
+Modular construction of a Byzantine agreement protocol with optimal message bit complexity
+Normal rank
@@ Property / cites work @@
+The Byzantine generals strike again
@@ Property / cites work: The Byzantine generals strike again / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on information exchange for Byzantine agreement
+Normal rank
@@ Property / cites work @@
+A lower bound for the time to assure interactive consistency
+Normal rank
@@ Property / cites work @@
+Easy impossibility proofs for distributed consensus problems
+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 @@
+The Byzantine Generals Problem
@@ Property / cites work: The Byzantine Generals Problem / 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
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01187076
+Normal rank
@@ Property / OpenAlex ID @@
+W1975556964
@@ Property / OpenAlex ID: W1975556964 / rank @@
+Normal rank