Fast timing-based algorithms (Q5137323): Difference between revisions

@@ Property / DOI @@
-.1007/s004460050020
@@ Property / DOI: 10.1007/s004460050020 / rank @@
-Normal rank
@@ Property / cites work @@
+Timing verification by successive approximation
@@ Property / cites work: Timing verification by successive approximation / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on shared memory for mutual exclusion
@@ Property / cites work: Bounds on shared memory for mutual exclusion / rank @@
+Normal rank
@@ Property / cites work @@
+Adaptive solutions to the mutual exclusion problem
+Normal rank
@@ Property / cites work @@
+Impossibility of distributed consensus with one faulty process
+Normal rank
@@ Property / cites work @@
+Q4002642
@@ Property / cites work: Q4002642 / rank @@
+Normal rank
@@ Property / cites work @@
+An axiomatic proof technique for parallel programs
+Normal rank
@@ Property / cites work @@
+Proving Liveness Properties of Concurrent Programs
+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 @@
+Improving fast mutual exclusion
@@ Property / cites work: Improving fast mutual exclusion / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S004460050020
@@ Property / DOI: 10.1007/S004460050020 / rank @@
+Normal rank