- Mihalis Yannakakis. The effect of a connectivity
requirement on the complexity of maximum subgraph problems.
Journal of the ACM, 26(4):618-630, October 1979.
Citations.
- Yehoshua Sagiv and Mihalis Yannakakis. Equivalences among relational
expressions with the union and difference operators. Journal
of the ACM, 27(4):633-655, October 1980.
Citations.
- David Maier, Yehoshua Sagiv, and Mihalis Yannakakis. On the complexity of testing
implications of functional and join dependencies. Journal of
the ACM, 28(4):680-695, October 1981.
Citations.
- Christos H. Papadimitriou and Mihalis Yannakakis. The complexity of restricted
spanning tree problems. Journal of the ACM,
29(2):285-309, April 1982.
Citations.
- Mihalis Yannakakis. A
theory of safe locking policies in database systems. Journal
of the ACM, 29(3):718-740, July 1982.
Citations.
- Catriel Beeri, Ronald Fagin, David Maier, and Mihalis Yannakakis. On the desirability of
acyclic database schemes. Journal of the ACM,
30(3):479-513, July 1983.
Citations.
- Mihalis Yannakakis. Serializability by locking.
Journal of the ACM, 31(2):227-244, April 1984.
Citations.
- Mihalis Yannakakis. A
polynomial algorithm for the min-cut linear arrangement of trees.
Journal of the ACM, 32(4):950-988, October 1985.
Citations.
- E. M. Arkin, C. H. Papadimitriou, and M. Yannakakis. Modularity of cycles and paths in
graphs. Journal of the ACM, 38(2):255-274, April 1991.
Citations,
etc.
- Avrim Blum, Tao Jiang, Ming Li, John Tromp, and Mihalis Yannakakis. Linear approximation of
shortest superstrings. Journal of the ACM,
41(4):630-647, July 1994.
References
and Citations.
- Carsten Lund and Mihalis Yannakakis. On the hardness of approximating
minimization problems. Journal of the ACM,
41(5):960-981, September 1994.
References,
Citations,
etc.
- Costas Courcoubetis and Mihalis Yannakakis. The complexity of
probabilistic verification. Journal of the ACM,
42(4):857-907, July 1995.
Abstract,
References,
etc.
Shortcuts: