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, for which the two received the 1979 Frederick W. Lanchester Prize from the Operations Research Society of America. He earned his PhD in computer science in 1970 from the University of Wisconsin-Madison and spent his career at AT&T Bell Laboratories' Mathematical Sciences Research Center from 1970 until his 1999 retirement, serving as its director for his final eleven years; his technical specialties included discrete algorithms, computational complexity, approximation algorithms, scheduling theory and graph theory, and he served as editor in chief of the Journal of the Association for Computing Machinery from 1978 to 1981.
Facts
Sources
1. Wikipedia: Michael Garey
Lead paragraph, birth year
Michael Randolph Garey (born November 19, 1945) is a computer science researcher
Lead paragraph, birth date
Michael Randolph Garey (born November 19, 1945)
View the SourceMichael Garey (Wikidata)
Wikidata alias: M. R. Garey
M. R. Garey
Wikidata P166: Frederick W. Lanchester Prize
Wikidata P166 (award received): Frederick W. Lanchester Prize.
Wikidata P166: ACM Fellow
Wikidata P166 (award received): ACM Fellow.
Wikidata alias: Michael Randolph Garey
Michael Randolph Garey
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.