|
Paris C. Kanellakis:
[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 Paris C. KanellakisOrdered by citing publication[Change the order to 'ordered by cited']
-
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:
-
Mihalis Yannakakis
Graph-Theoretic Methods in Database Theory. [Citation Graph (4, 60)][DBLP] PODS, 1990, pp:230-242 [Conf] Cites:
-
Catriel Beeri, Paris C. Kanellakis, François Bancilhon, Raghu Ramakrishnan
Bounds on the Propagation of Selection into Logic Programs. [Citation Graph (31, 19)][DBLP] PODS, 1987, pp:214-226 [Conf]
-
Stavros S. Cosmadakis, Paris C. Kanellakis
Parallel Evaluation of Recursive Rule Queries. [Citation Graph (22, 28)][DBLP] PODS, 1986, pp:280-293 [Conf]
-
Cynthia Dwork, Paris C. Kanellakis, Larry J. Stockmeyer
Parallel Algorithms for Term Matching. [Citation Graph (2, 0)][DBLP] SIAM J. Comput., 1988, v:17, n:4, pp:711-731 [Journal]
|