On the message complexity of binary Byzantine agreement under crash failures (Q1189856): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
+Normal rank
@@ Property / cites work @@
+Bounds on information exchange for Byzantine agreement
+Normal rank
@@ Property / cites work @@
+Authenticated Algorithms for Byzantine Agreement
@@ Property / cites work: Authenticated Algorithms for Byzantine Agreement / rank @@
+Normal rank
@@ Property / cites work @@
+Knowledge and common knowledge in a Byzantine environment: Crash failures
+Normal rank
@@ Property / cites work @@
+Q4734747
@@ Property / cites work: Q4734747 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3666268
@@ Property / cites work: Q3666268 / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for the time to assure interactive consistency
+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 @@
+Reaching Agreement in the Presence of Faults
@@ Property / cites work: Reaching Agreement in the Presence of Faults / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1189856