|
Mihalis Yannakakis:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Stavros S. Cosmadakis:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Which papers of Stavros S. Cosmadakis cite Mihalis YannakakisOrdered by cited publication[Change the order to 'ordered by citing']
-
Christos H. Papadimitriou, Mihalis Yannakakis
The Complexity of Facets (and Some Facets of Complexity) [Citation Graph (3, 0)][DBLP] STOC, 1982, pp:255-260 [Conf] Is cited by:
-
Mihalis Yannakakis
Algorithms for Acyclic Database Schemes [Citation Graph (48, 22)][DBLP] VLDB, 1981, pp:82-94 [Conf] Is cited by:
-
Peter Honeyman, Richard E. Ladner, Mihalis Yannakakis
Testing the Universal Instance Assumption. [Citation Graph (16, 0)][DBLP] Inf. Process. Lett., 1980, v:10, n:1, pp:14-19 [Journal] Is cited by:
-
Esther M. Arkin, Christos H. Papadimitriou, Mihalis Yannakakis
Modularity of Cycles and Paths in Graphs. [Citation Graph (1, 0)][DBLP] J. ACM, 1991, v:38, n:2, pp:255-274 [Journal] Is cited by:
-
David Maier, Yehoshua Sagiv, Mihalis Yannakakis
On the Complexity of Testing Implications of Functional and Join Dependencies. [Citation Graph (13, 0)][DBLP] J. ACM, 1981, v:28, n:4, pp:680-695 [Journal] Is cited by:
-
Yehoshua Sagiv, Mihalis Yannakakis
Equivalences Among Relational Expressions with the Union and Difference Operators. [Citation Graph (56, 0)][DBLP] J. ACM, 1980, v:27, n:4, pp:633-655 [Journal] Is cited by:
-
Foto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis
On Datalog vs. Polynomial Time. [Citation Graph (2, 0)][DBLP] J. Comput. Syst. Sci., 1995, v:51, n:2, pp:177-196 [Journal] Is cited by:
-
Mihalis Yannakakis, Christos H. Papadimitriou
Algebraic Dependencies. [Citation Graph (18, 0)][DBLP] J. Comput. Syst. Sci., 1982, v:25, n:1, pp:2-41 [Journal] Is cited by:
-
Ronald Fagin, David Maier, Jeffrey D. Ullman, Mihalis Yannakakis
Tools for Template Dependencies. [Citation Graph (8, 0)][DBLP] SIAM J. Comput., 1983, v:12, n:1, pp:36-59 [Journal] Is cited by:
|