Mihalis Yannakakis (Greek Μιχάλης Γιαννακάκης Michalis Giannakakis, born 13 September 1953 in Athens) is a Greek computer scientist. Yannakakis an der Columbia University 2006
Yannakakis earned his diploma in electrical engineering at the National Technical University in Athens in 1975. In 1979, he was promoted to Jeffrey Ullman at Princeton University. Since 1978 he was at the Bell Laboratories, where he headed the Computing Principles Research Department from 1991 onwards. As of 2001, he served as a member of Avaya Laboratories in Basking Ridge, New Jersey. In 2002 he became professor of computer science at Stanford University and from Columbia University in 2004.
He is concerned with algorithm design and analysis, combinatorial optimization, databases (especially the study of acyclic databases), computer-assisted test methods and verification methods, algorithmic graph theory, and complexity theory. In 1988, he introduced new complexity classes (Max-NP and his subclass Max-SNP) with Christos Papadimitriou, which also include known problems such as the problem of the traveling traveler and 3-SAT. His work with Carsten Lund also had an impact on the difficulty of obtaining approximation methods for NP-difficult minimization problems such as the graph coloring problem and the quantity overlap problem.
In 1997 he became a Fellow of the Bell Laboratories, in 1985 he received the Distinguished Member of the Technical Staff Award of the Laboratory and in 2000 he received the Gold Medal of the President of the Bell Labs. In 2005 he received the Knuth Prize. Since 1998 he is a Fellow of the Association for Computing Machinery (ACM). From 1992 to 2003 he was co-publisher and since 1998 editor-in-chief of the SIAM Journal of Computing. In addition, he was co-editor of the Journal of the ACM from 1986 to 2000 and has co-edited the Journal of Combinatorial Optimization since 1997 and the Journal of Complexity since 2004. Weblinks Edit sourcetext Single-level Edit source text
wiki