Michael Garey

From Wikipedia, the free encyclopedia
  (Redirected from Michael R. Garey)
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]

[edit] References

  1. ^ "The Mathematics Genealogy Project: Michael Randolph Garey". http://genealogy.math.ndsu.nodak.edu/id.php?id=82732. 
  2. ^ "ACM: Fellows Award / Michael R Garey". Association for Computing Machinery. http://fellows.acm.org/fellow_citation.cfm?id=1074483&srt=all. Retrieved 2009-01-24. 

[edit] External links


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=453757377"
Personal tools
Namespaces
Variants
Actions
Navigation
Interaction
Toolbox
Print/export
Languages