|
Christos H. Papadimitriou:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Mihalis Yannakakis:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Which papers of Mihalis Yannakakis cite Christos H. PapadimitriouOrdered by citing publication[Change the order to 'ordered by cited']
-
Foto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis
On Datalog vs. Polynomial Time. [Citation Graph (8, 13)][DBLP] PODS, 1991, pp:13-25 [Conf] Cites:
-
Thanasis Hadzilacos, Mihalis Yannakakis
Deleting Completed Transactions. [Citation Graph (1, 9)][DBLP] PODS, 1986, pp:43-46 [Conf] Cites:
-
Christos H. Papadimitriou, Mihalis Yannakakis
The Complexity of Reliable Concurrency Control. [Citation Graph (0, 4)][DBLP] PODS, 1985, pp:230-234 [Conf] Cites:
-
Christos H. Papadimitriou, Mihalis Yannakakis
Tie-Breaking Semantics and Structural Totality. [Citation Graph (5, 9)][DBLP] PODS, 1992, pp:16-22 [Conf] Cites:
-
Christos H. Papadimitriou, Martha Sideri
On Finding Extensions of Default Theories. [Citation Graph (1, 8)][DBLP] ICDT, 1992, pp:276-281 [Conf]
-
Phokion G. Kolaitis, Christos H. Papadimitriou
Why not Negation by Fixpoint? [Citation Graph (8, 0)][DBLP] J. Comput. Syst. Sci., 1991, v:43, n:1, pp:125-144 [Journal]
-
Christos H. Papadimitriou, Mihalis Yannakakis
On the Complexity of Database Queries. [Citation Graph (2, 12)][DBLP] PODS, 1997, pp:12-19 [Conf] Cites:
-
Ouri Wolfson, Mihalis Yannakakis
Deadlock-Freedom (and Safety) of Transactions in a Distributed Database. [Citation Graph (3, 17)][DBLP] PODS, 1985, pp:105-112 [Conf] Cites:
-
Paris C. Kanellakis, Christos H. Papadimitriou
The Complexity of Distributed Concurrency Control [Citation Graph (9, 0)][DBLP] FOCS, 1981, pp:185-197 [Conf]
-
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]
-
Paris C. Kanellakis, Christos H. Papadimitriou
Is Distributed Locking Harder? [Citation Graph (3, 15)][DBLP] PODS, 1982, pp:98-107 [Conf]
-
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]
-
Mihalis Yannakakis
Querying Weak Instances. [Citation Graph (1, 19)][DBLP] PODS, 1984, pp:275-280 [Conf] Cites:
-
Mihalis Yannakakis
Graph-Theoretic Methods in Database Theory. [Citation Graph (4, 60)][DBLP] PODS, 1990, pp:230-242 [Conf] Cites:
|