|
Christos H. Papadimitriou:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Eljas Soisalon-Soininen:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Which papers of Eljas Soisalon-Soininen cite Christos H. PapadimitriouOrdered by citing publication[Change the order to 'ordered by cited']
-
Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer
Towards Online Schedulers Based on Pre-Analysis Locking. [Citation Graph (2, 15)][DBLP] ICDT, 1986, pp:242-259 [Conf] Cites:
-
Christos H. Papadimitriou
The serializability of concurrent database updates. [Citation Graph (114, 0)][DBLP] J. ACM, 1979, v:26, n:4, pp:631-653 [Journal]
-
Witold Lipski Jr., Christos H. Papadimitriou
A Fast Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems. [Citation Graph (6, 0)][DBLP] J. Algorithms, 1981, v:2, n:3, pp:211-226 [Journal]
-
Christos H. Papadimitriou
Concurrency Control by Locking. [Citation Graph (7, 0)][DBLP] SIAM J. Comput., 1983, v:12, n:2, pp:215-226 [Journal]
-
Georg Lausen, Eljas Soisalon-Soininen
Locling Policies and Predeclared Transactions. [Citation Graph (0, 15)][DBLP] MFDBS, 1989, pp:317-336 [Conf] Cites:
-
Mihalis Yannakakis, Christos H. Papadimitriou, H. T. Kung
Locking Policies: Safety and Freedom from Deadlock [Citation Graph (19, 0)][DBLP] FOCS, 1979, pp:286-297 [Conf]
-
Christos H. Papadimitriou
A theorem in database concurrency control. [Citation Graph (5, 0)][DBLP] J. ACM, 1982, v:29, n:4, pp:998-1006 [Journal]
-
Christos H. Papadimitriou
The serializability of concurrent database updates. [Citation Graph (114, 0)][DBLP] J. ACM, 1979, v:26, n:4, pp:631-653 [Journal]
-
Christos H. Papadimitriou
Concurrency Control by Locking. [Citation Graph (7, 0)][DBLP] SIAM J. Comput., 1983, v:12, n:2, pp:215-226 [Journal]
-
Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer
Maximal Concurrency by Locking. [Citation Graph (1, 9)][DBLP] PODS, 1984, pp:38-44 [Conf] Cites:
-
Christos H. Papadimitriou
A theorem in database concurrency control. [Citation Graph (5, 0)][DBLP] J. ACM, 1982, v:29, n:4, pp:998-1006 [Journal]
-
Christos H. Papadimitriou
The serializability of concurrent database updates. [Citation Graph (114, 0)][DBLP] J. ACM, 1979, v:26, n:4, pp:631-653 [Journal]
-
Witold Lipski Jr., Christos H. Papadimitriou
A Fast Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems. [Citation Graph (6, 0)][DBLP] J. Algorithms, 1981, v:2, n:3, pp:211-226 [Journal]
-
Christos H. Papadimitriou
Concurrency Control by Locking. [Citation Graph (7, 0)][DBLP] SIAM J. Comput., 1983, v:12, n:2, pp:215-226 [Journal]
-
Eljas Soisalon-Soininen, Derick Wood
An Optimal Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems. [Citation Graph (0, 3)][DBLP] PODS, 1982, pp:108-116 [Conf] Cites:
-
Mihalis Yannakakis, Christos H. Papadimitriou, H. T. Kung
Locking Policies: Safety and Freedom from Deadlock [Citation Graph (19, 0)][DBLP] FOCS, 1979, pp:286-297 [Conf]
-
Witold Lipski Jr., Christos H. Papadimitriou
A Fast Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems. [Citation Graph (6, 0)][DBLP] J. Algorithms, 1981, v:2, n:3, pp:211-226 [Journal]
-
Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer
Pre-Analysis Locking: A Safe and Deadlock Free Locking Policy. [Citation Graph (1, 13)][DBLP] VLDB, 1985, pp:270-281 [Conf] Cites:
-
Christos H. Papadimitriou
A theorem in database concurrency control. [Citation Graph (5, 0)][DBLP] J. ACM, 1982, v:29, n:4, pp:998-1006 [Journal]
-
Christos H. Papadimitriou
The serializability of concurrent database updates. [Citation Graph (114, 0)][DBLP] J. ACM, 1979, v:26, n:4, pp:631-653 [Journal]
-
Witold Lipski Jr., Christos H. Papadimitriou
A Fast Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems. [Citation Graph (6, 0)][DBLP] J. Algorithms, 1981, v:2, n:3, pp:211-226 [Journal]
-
Christos H. Papadimitriou
Concurrency Control by Locking. [Citation Graph (7, 0)][DBLP] SIAM J. Comput., 1983, v:12, n:2, pp:215-226 [Journal]
|