|
Haim Gaifman:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Surajit Chaudhuri:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Which papers of Surajit Chaudhuri cite Haim GaifmanOrdered by citing publication[Change the order to 'ordered by cited']
-
Surajit Chaudhuri
Finding Nonrecursive Envelopes for Datalog Predicates. [Citation Graph (2, 13)][DBLP] PODS, 1993, pp:135-146 [Conf] Cites:
-
Surajit Chaudhuri, Phokion G. Kolaitis
Can Datalog be Approximated? [Citation Graph (3, 15)][DBLP] PODS, 1994, pp:86-96 [Conf] Cites:
-
Haim Gaifman, Harry G. Mairson, Yehoshua Sagiv, Moshe Y. Vardi
Undecidable Optimization Problems for Database Logic Programs [Citation Graph (26, 0)][DBLP] LICS, 1987, pp:106-115 [Conf]
-
Stavros S. Cosmadakis, Haim Gaifman, Paris C. Kanellakis, Moshe Y. Vardi
Decidable Optimization Problems for Database Logic Programs (Preliminary Report) [Citation Graph (20, 0)][DBLP] STOC, 1988, pp:477-490 [Conf]
-
Surajit Chaudhuri, Moshe Y. Vardi
On the Equivalence of Recursive and Nonrecursive Datalog Programs. [Citation Graph (16, 31)][DBLP] PODS, 1992, pp:55-66 [Conf] Cites:
-
Haim Gaifman, Harry G. Mairson, Yehoshua Sagiv, Moshe Y. Vardi
Undecidable Optimization Problems for Database Logic Programs [Citation Graph (26, 0)][DBLP] LICS, 1987, pp:106-115 [Conf]
-
Stavros S. Cosmadakis, Haim Gaifman, Paris C. Kanellakis, Moshe Y. Vardi
Decidable Optimization Problems for Database Logic Programs (Preliminary Report) [Citation Graph (20, 0)][DBLP] STOC, 1988, pp:477-490 [Conf]
-
Surajit Chaudhuri, Moshe Y. Vardi
On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs. [Citation Graph (2, 23)][DBLP] PODS, 1994, pp:107-116 [Conf] Cites:
|