Author
Michael Garey
American computer scientist
wd:Q68305281945 -
country of citizenship: United States of America
language of expression: English
educated at: University of Wisconsin–Madison
occupation: computer scientist, engineer
award received: ACM Fellow, Frederick W. Lanchester Prize
Michael Randolph Garey (born November 19, 1945) 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 Frederick W. 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. 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.
Read more or edit on Wikipedia
Series
0Articles
6Some simplified NP-complete graph problems ( 1976 )
wetenschappelijk artikel
author: Larry Stockmeyer, Michael Garey, David S. Johnson
Complexity Results for Multiprocessor Scheduling under Resource Constraints ( 1975 )
scientific article published in December 1975
author: David S. Johnson, Michael Garey
Resource constrained scheduling as generalized bin packing ( 1976 )
scientific article published in 1976
author: Ronald Graham, Andrew Yao, David S. Johnson, Michael Garey
The Complexity of Near-Optimal Graph Coloring ( 1976 )
scientific article published in 1976
author: Michael Garey, David S. Johnson
Bounds for Multiprocessor Scheduling with Resource Constraints ( 1975 )
scientific article published in 1975
author: Ronald Graham, Michael Garey