|
Gabriel M. Kuper:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Andrei Voronkov:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Which papers of Andrei Voronkov cite Gabriel M. KuperOrdered by citing publication[Change the order to 'ordered by cited']
-
Evgeny Dantsin, Andrei Voronkov
Expressive Power and Data Complexity of Query Languages for Trees and Lists. [Citation Graph (1, 24)][DBLP] PODS, 2000, pp:157-165 [Conf] Cites:
-
Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz
Constraint Query Languages. [Citation Graph (37, 0)][DBLP] J. Comput. Syst. Sci., 1995, v:51, n:1, pp:26-52 [Journal]
-
Gabriel M. Kuper, Moshe Y. Vardi
On the Complexity of Queries in the Logical Data Model. [Citation Graph (8, 0)][DBLP] Theor. Comput. Sci., 1993, v:116, n:1&2, pp:33-57 [Journal]
-
Gabriel M. Kuper, Moshe Y. Vardi
The Logical Data Model. [Citation Graph (6, 38)][DBLP] ACM Trans. Database Syst., 1993, v:18, n:3, pp:379-413 [Journal]
-
Sergei G. Vorobyov, Andrei Voronkov
Complexity of Nonrecursive Logic Programs with Complex Values. [Citation Graph (1, 33)][DBLP] PODS, 1998, pp:244-253 [Conf] Cites:
-
Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz
Constraint Query Languages. [Citation Graph (37, 0)][DBLP] J. Comput. Syst. Sci., 1995, v:51, n:1, pp:26-52 [Journal]
-
Gabriel M. Kuper
Logic Programming with Sets. [Citation Graph (10, 0)][DBLP] J. Comput. Syst. Sci., 1990, v:41, n:1, pp:44-64 [Journal]
-
Gabriel M. Kuper, Moshe Y. Vardi
On the Complexity of Queries in the Logical Data Model. [Citation Graph (8, 0)][DBLP] Theor. Comput. Sci., 1993, v:116, n:1&2, pp:33-57 [Journal]
|