迈克尔·兰道夫·加雷

Michael Garey
生卒
1945 –
国籍
美国
外文名
Michael Garey

生平与创作

这个词条暂时没有中文维基百科条目,下面是英文维基百科的内容(英文原文):

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.

以上文字摘自英文维基百科「Michael Garey」(去掉了参考文献等尾部小节),按 CC BY-SA 4.0 使用,作者为维基百科的各位编者。

资料卡

出生
1945 年 11 月 19 日
出生地
马尼托沃克
职业
计算机科学家、工程师
使用语言
英语
就读学校
威斯康星大学麦迪逊分校
领域
计算机科学、信息学、算法、离散数学、计算复杂性理论 等 8 项
所属团体
计算机协会(1995)
获奖
ACM会士(1995);另有 1 项只有外文名

资料卡来自 Wikidata Q6830528(CC0),众包数据,个别字段可能不全。

本站收录的作品(1)

作品年表(1 本)

本站书库里署名迈克尔·兰道夫·加雷的书(Open Library 上至少 10 人加过书架的才收),按首版年份排(有本站书页的用 Wikidata 记的首版年,其余用 Open Library 的);年份偶尔记成后来的版本或译本,以原书为准。全部作品见 Open Library。

  1. 1979Computers and intractability书架 14

同时代的美国作家

资料来源