|
Stavros S. Cosmadakis:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Foto N. Afrati:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Which papers of Foto N. Afrati cite Stavros S. CosmadakisOrdered by citing publication[Change the order to 'ordered by cited']
-
Foto N. Afrati, Manolis Gergatsoulis, Theodoros G. Kavalieros
Answering Queries Using Materialized Views with Disjunctions. [Citation Graph (4, 13)][DBLP] ICDT, 1999, pp:435-452 [Conf] Cites:
-
Foto N. Afrati
Bounded Arity Datalog (!=) Queries on Graphs. [Citation Graph (0, 15)][DBLP] PODS, 1994, pp:97-106 [Conf] Cites:
-
Foto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis
On Datalog vs. Polynomial Time. [Citation Graph (8, 13)][DBLP] PODS, 1991, pp:13-25 [Conf]
-
Foto N. Afrati, Stavros S. Cosmadakis
Expressiveness of Restricted Recursive Queries (Extended Abstract) [Citation Graph (9, 0)][DBLP] STOC, 1989, pp:113-126 [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]
-
Foto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis
On Datalog vs. Polynomial Time. [Citation Graph (8, 13)][DBLP] PODS, 1991, pp:13-25 [Conf] Cites:
-
Foto N. Afrati, Christos H. Papadimitriou
The Parallel Complexity of Simple Chain Queries. [Citation Graph (12, 2)][DBLP] PODS, 1987, pp:210-213 [Conf] Cites:
|