The parallel complexity of deadlock detection (Q1091805): Difference between revisions

@@ Property / cites work @@
+Q4066554
@@ Property / cites work: Q4066554 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear programming is log-space hard for P
@@ Property / cites work: Linear programming is log-space hard for P / rank @@
+Normal rank
@@ Property / cites work @@
+Deadlock Prediction: Easy and Difficult Cases
@@ Property / cites work: Deadlock Prediction: Easy and Difficult Cases / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum flow problem is log space complete for P
+Normal rank
@@ Property / cites work @@
+Prevention of system deadlocks
@@ Property / cites work: Prevention of system deadlocks / rank @@
+Normal rank
@@ Property / cites work @@
+Comments on prevention of system deadlocks
@@ Property / cites work: Comments on prevention of system deadlocks / rank @@
+Normal rank
@@ Property / cites work @@
+Complete problems for deterministic polynomial time
+Normal rank
@@ Property / cites work @@
+Testing Deadlock-Freedom of Computer Systems
@@ Property / cites work: Testing Deadlock-Freedom of Computer Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Locking and Deadlock Detection in Distributed Data Bases
+Normal rank
@@ Property / cites work @@
+Deadlock avoidance revisited
@@ Property / cites work: Deadlock avoidance revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Q3945587
@@ Property / cites work: Q3945587 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast, Efficient Parallel Algorithms for Some Graph Problems
+Normal rank
@@ Property / cites work @@
+Q4066555
@@ Property / cites work: Q4066555 / rank @@
+Normal rank
@@ Property / cites work @@
+Game interpretation of the deadlock avoidance problem
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank