|
Gerd G. Hillebrand:
[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 Gerd G. HillebrandOrdered 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, Moshe Y. Vardi
On the Equivalence of Recursive and Nonrecursive Datalog Programs. [Citation Graph (16, 31)][DBLP] PODS, 1992, pp:55-66 [Conf] Cites:
-
Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson, Moshe Y. Vardi
Tools for Datalog Boundedness. [Citation Graph (8, 18)][DBLP] PODS, 1991, pp:1-12 [Conf]
-
Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson, Moshe Y. Vardi
Undecidable Boundedness Problems for Datalog Programs. [Citation Graph (4, 0)][DBLP] J. Log. Program., 1995, v:25, n:2, pp:163-190 [Journal]
-
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:
|