About: Michael Garey     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatFellowsOfTheAssociationForComputingMachinery, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FMichael_Garey&invfp=IFP_OFF&sas=SAME_AS_OFF

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

AttributesValues
rdf:type
rdfs:label
  • Michael Garey (de)
  • Michael Garey (es)
  • Michael Garey (fr)
  • Michael Garey (en)
rdfs:comment
  • Michael Randolph Garey (* 19. November 1945 in Manitowoc, Wisconsin) ist ein US-amerikanischer Informatiker. (de)
  • 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).​ (es)
  • Michael Randolph Garey, né le 19 novembre 1945 à Manitowoc dans le Wisconsin, est un informaticien américain. (fr)
  • 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 (en)
birth place
birth place
  • Manitowoc, Wisconsin, U.S. (en)
birth date
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
dbp:wikiPageUsesTemplate
alma mater
birth date
birth name
  • Michael Randolph Garey (en)
fields
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 49 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software