|
Gerd G. Hillebrand:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Moshe Y. Vardi:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Which papers of Moshe Y. Vardi cite Gerd G. HillebrandOrdered by citing publication[Change the order to 'ordered by cited']
-
Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi
View-Based Query Processing for Regular Path Queries with Inverse. [Citation Graph (2, 31)][DBLP] PODS, 2000, pp:58-66 [Conf] Cites:
-
Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi
Rewriting of Regular Expressions and Regular Path Queries. [Citation Graph (6, 31)][DBLP] PODS, 1999, pp:194-204 [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:
-
Moshe Y. Vardi
Constraint Satisfaction and Database Theory: a Tutorial. [Citation Graph (0, 45)][DBLP] PODS, 2000, pp:76-85 [Conf] Cites:
-
Serge Abiteboul, Gabriel M. Kuper, Harry G. Mairson, Alexander A. Shvartsman, Moshe Y. Vardi
In Memoriam Paris C. Kanellakis. [Citation Graph (0, 32)][DBLP] ACM Comput. Surv., 1996, v:28, n:1, pp:3-15 [Journal] Cites:
-
Paris C. Kanellakis, Gerd G. Hillebrand, Harry G. Mairson
An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction. [Citation Graph (1, 0)][DBLP] ICALP, 1994, pp:83-105 [Conf]
-
Gerd G. Hillebrand, Paris C. Kanellakis
On the Expressive Power of Simply Typed and Let-Polymorphic Lambda Calculi. [Citation Graph (1, 0)][DBLP] LICS, 1996, pp:253-263 [Conf]
-
Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson
Database Query Languages Embedded in the Typed Lambda Calculus [Citation Graph (6, 0)][DBLP] LICS, 1993, pp:332-343 [Conf]
-
Gerd G. Hillebrand, Paris C. Kanellakis, Sridhar Ramaswamy
Functional Programming Formalisms for OODBMS Methods. [Citation Graph (2, 0)][DBLP] NATO ASI OODBS, 1993, pp:73-99 [Conf]
-
Gerd G. Hillebrand, Paris C. Kanellakis
Functional Database Query Languages as Typed Lambda Calculi of Fixed Order. [Citation Graph (4, 30)][DBLP] PODS, 1994, pp:222-231 [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]
|