Jump to content

Michael Garey

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Chris the speller (talk | contribs) at 04:10, 15 April 2018 (→‎top: per WP:JOBTITLES, replaced: Director → director using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Michael Garey
Born(1945-11-19)November 19, 1945
Manitowoc
NationalityAmerican
Alma materUniversity of Wisconsin–Madison
Scientific career
FieldsComputer science

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 and Johnson received the 1979 Lanchester Prize from the Operations Research Society of America for the book. Garey earned his PhD in computer science in 1970 from the University of Wisconsin–Madison.[1] He was employed by AT&T Bell Laboratories in the Mathematical Sciences Research Center from 1970 until his retirement in 1999. For his last 11 years with the organization, he served as its director. His technical specialties included discrete algorithms and computational complexity, approximation algorithms, scheduling theory, and graph theory. From 1978 until 1981 he served as Editor-in-Chief of The Journal of the Association for Computing Machinery. In 1995, Garey was inducted as a Fellow of the Association for Computing Machinery.[2]

References

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


P ≟ NP 

This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Michael_Garey&oldid=836497256"