|
Mihalis Yannakakis:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Paris C. Kanellakis:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Which papers of Paris C. Kanellakis cite Mihalis YannakakisOrdered by citing publication[Change the order to 'ordered by cited']
-
Stavros S. Cosmadakis, Paris C. Kanellakis
Parallel Evaluation of Recursive Rule Queries. [Citation Graph (22, 28)][DBLP] PODS, 1986, pp:280-293 [Conf] Cites:
-
Yehoshua Sagiv, Mihalis Yannakakis
Equivalences Among Relational Expressions with the Union and Difference Operators. [Citation Graph (56, 0)][DBLP] J. ACM, 1980, v:27, n:4, pp:633-655 [Journal]
-
Ronald Fagin, David Maier, Jeffrey D. Ullman, Mihalis Yannakakis
Tools for Template Dependencies. [Citation Graph (8, 0)][DBLP] SIAM J. Comput., 1983, v:12, n:1, pp:36-59 [Journal]
-
Stavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos
Partition Semantics for Relations. [Citation Graph (6, 7)][DBLP] PODS, 1985, pp:261-275 [Conf] Cites:
-
Paris C. Kanellakis, Christos H. Papadimitriou
Is Distributed Locking Harder? [Citation Graph (3, 15)][DBLP] PODS, 1982, pp:98-107 [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]
-
Mihalis Yannakakis
A Theory of Safe Locking Policies in Database Systems. [Citation Graph (22, 0)][DBLP] J. ACM, 1982, v:29, n:3, pp:718-740 [Journal]
-
Christos H. Papadimitriou, Paris C. Kanellakis
On Concurrency Control by Multiple Versions. [Citation Graph (12, 12)][DBLP] PODS, 1982, pp:76-82 [Conf] Cites:
-
Serge Abiteboul, Paris C. Kanellakis, Gösta Grahne
On the Representation and Querying of Sets of Possible Worlds. [Citation Graph (14, 15)][DBLP] SIGMOD Conference, 1987, pp:34-48 [Conf] Cites:
-
Peter Honeyman, Richard E. Ladner, Mihalis Yannakakis
Testing the Universal Instance Assumption. [Citation Graph (16, 0)][DBLP] Inf. Process. Lett., 1980, v:10, n:1, pp:14-19 [Journal]
-
David Maier, Yehoshua Sagiv, Mihalis Yannakakis
On the Complexity of Testing Implications of Functional and Join Dependencies. [Citation Graph (13, 0)][DBLP] J. ACM, 1981, v:28, n:4, pp:680-695 [Journal]
-
Christos H. Papadimitriou, Paris C. Kanellakis
On Concurrency Control by Multiple Versions. [Citation Graph (14, 12)][DBLP] ACM Trans. Database Syst., 1984, v:9, n:1, pp:89-99 [Journal] Cites:
|