Michael Garey

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Michael Randolph Garey is a computer science researcher, and co-author (with David S. Johnson) of Computers and Intractability: A Guide to the Theory of NP-completeness. He earned his PhD in computer science in 1970 from the University of Wisconsin–Madison.[1] In 1995 he was inducted as a Fellow of the Association for Computing Machinery.[2]

References [edit]

  1. ^ "The Mathematics Genealogy Project: Michael Randolph Garey". 
  2. ^ "ACM: Fellows Award / Michael R Garey". Association for Computing Machinery. Retrieved 2009-01-24. 

External links [edit]


P ≟ NP  This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org/w/index.php?title=Michael_Garey&oldid=543979488"