|
Raghu Ramakrishnan:
[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 Raghu RamakrishnanOrdered by citing publication[Change the order to 'ordered by cited']
-
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]
-
Catriel Beeri, Raghu Ramakrishnan
On the Power of Magic. [Citation Graph (84, 10)][DBLP] PODS, 1987, pp:269-284 [Conf]
-
François Bancilhon, Raghu Ramakrishnan
An Amateur's Introduction to Recursive Query Processing Strategies. [Citation Graph (187, 17)][DBLP] SIGMOD Conference, 1986, pp:16-52 [Conf]
-
Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman
Efficient Evaluation of Right-, Left-, and Mult-Lineare Rules. [Citation Graph (29, 12)][DBLP] SIGMOD Conference, 1989, pp:235-242 [Conf]
-
Yannis E. Ioannidis, Raghu Ramakrishnan
Efficient Transitive Closure Algorithms. [Citation Graph (40, 12)][DBLP] VLDB, 1988, pp:382-394 [Conf]
-
Jeffrey D. Ullman, Mihalis Yannakakis
The Input/Output Complexity of Transitive Closure. [Citation Graph (13, 7)][DBLP] SIGMOD Conference, 1990, pp:44-53 [Conf] Cites:
|