Closed schedulers: a novel technique for analyzing asynchronous protocols (Q5136996): Difference between revisions

@@ Property / cites work @@
+Renaming in an asynchronous environment
@@ Property / cites work: Renaming in an asynchronous environment / rank @@
+Normal rank
@@ Property / cites work @@
+A combinatorial characterization of the distributed 1-solvable tasks
+Normal rank
@@ Property / cites work @@
+Generalized FLP impossibility result for <i>t</i>-resilient asynchronous computations
+Normal rank
@@ Property / cites work @@
+More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
+Normal rank
@@ Property / cites work @@
+Impossibility of distributed consensus with one faulty process
+Normal rank
@@ Property / cites work @@
+The asynchronous computability theorem for <i>t</i>-resilient tasks
+Normal rank
@@ Property / cites work @@
+Q5762903
@@ Property / cites work: Q5762903 / rank @@
+Normal rank
@@ Property / cites work @@
+Wait-free <i>k</i>-set agreement is impossible
@@ Property / cites work: Wait-free <i>k</i>-set agreement is impossible / rank @@
+Normal rank