Distributed computing in asynchronous networks with byzantine edges (Q6184680): Difference between revisions

@@ Property / cites work @@
+Fault-tolerant distributed algorithm for election in complete networks
+Normal rank
@@ Property / cites work @@
+Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
+Normal rank
@@ Property / cites work @@
+Impossibility of distributed consensus with one faulty process
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / 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 / cites work @@
+Distributed agreement in the presence of processor and communication faults
+Normal rank
@@ Property / cites work @@
+A new solution for the Byzantine generals problem
@@ Property / cites work: A new solution for the Byzantine generals problem / rank @@
+Normal rank
@@ Property / cites work @@
+Tolerating linear number of faults in networks of bounded degree
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6184680