|
Ashok K. Chandra:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Mihalis Yannakakis:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Which papers of Mihalis Yannakakis cite Ashok K. ChandraOrdered by citing publication[Change the order to 'ordered by cited']
-
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:
-
Christos H. Papadimitriou, Mihalis Yannakakis
The Complexity of Reliable Concurrency Control. [Citation Graph (0, 4)][DBLP] PODS, 1985, pp:230-234 [Conf] Cites:
-
Christos H. Papadimitriou, Mihalis Yannakakis
Tie-Breaking Semantics and Structural Totality. [Citation Graph (5, 9)][DBLP] PODS, 1992, pp:16-22 [Conf] Cites:
-
Christos H. Papadimitriou, Mihalis Yannakakis
On the Complexity of Database Queries. [Citation Graph (2, 12)][DBLP] PODS, 1997, pp:12-19 [Conf] Cites:
-
Mihalis Yannakakis
Graph-Theoretic Methods in Database Theory. [Citation Graph (4, 60)][DBLP] PODS, 1990, pp:230-242 [Conf] Cites:
-
Yehoshua Sagiv, Mihalis Yannakakis
Equivalence among Relational Expressions with the Union and Difference Operation. [Citation Graph (4, 16)][DBLP] VLDB, 1978, pp:535-548 [Conf] Cites:
|