Michael Garey
http://dbpedia.org/resource/Michael_Garey an entity of type: Thing
Michael Randolph Garey (* 19. November 1945 in Manitowoc, Wisconsin) ist ein US-amerikanischer Informatiker.
rdf:langString
Michael Randolph Garey es un informático teórico estadounidense, coautor (junto a David S. Johnson) del famoso libro de texto Computers and Intractability: A Guide to the Theory of NP-Completeness. Obtuvo su PhD en ciencias de la computación en 1970, en la Universidad de Wisconsin-Madison. En 1995 fue nombrado miembro de la Association for Computing Machinery (ACM).
rdf:langString
Michael Randolph Garey, né le 19 novembre 1945 à Manitowoc dans le Wisconsin, est un informaticien américain.
rdf:langString
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-i
rdf:langString
rdf:langString
Michael Garey
rdf:langString
Michael Garey
rdf:langString
Michael Garey
rdf:langString
Michael Garey
rdf:langString
Manitowoc, Wisconsin, U.S.
xsd:date
1945-11-19
xsd:integer
1709372
xsd:integer
1086425975
xsd:date
1945-11-19
rdf:langString
Michael Randolph Garey
rdf:langString
American
rdf:langString
Michael Randolph Garey (* 19. November 1945 in Manitowoc, Wisconsin) ist ein US-amerikanischer Informatiker.
rdf:langString
Michael Randolph Garey es un informático teórico estadounidense, coautor (junto a David S. Johnson) del famoso libro de texto Computers and Intractability: A Guide to the Theory of NP-Completeness. Obtuvo su PhD en ciencias de la computación en 1970, en la Universidad de Wisconsin-Madison. En 1995 fue nombrado miembro de la Association for Computing Machinery (ACM).
rdf:langString
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.
rdf:langString
Michael Randolph Garey, né le 19 novembre 1945 à Manitowoc dans le Wisconsin, est un informaticien américain.
xsd:nonNegativeInteger
2372
rdf:langString
Michael Randolph Garey