Jump to content

David S. Johnson

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Kevin chen2003 (talk | contribs) at 22:21, 9 March 2016 (add citation for death). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

David Stifler Johnson (born December 9, 1945, Washington, D.C. - died March 8, 2016[1]) is an American computer scientist specializing in algorithms and optimization. He was the head of the Algorithms and Optimization Department of AT&T Labs Research from 1988 to 2013, and is a visiting professor at Columbia University. He was awarded the 2010 Knuth Prize.[2]

Johnson graduated summa cum laude from Amherst College in 1967, then earned his S.M. from MIT in 1968 and his Ph.D. from MIT in 1973. All three of his degrees are in mathematics. He was inducted as a Fellow of the Association for Computing Machinery in 1995, and as a member of the National Academy of Engineering in 2016.

He is the coauthor of Computers and Intractability: A Guide to the Theory of NP-Completeness (ISBN 0-7167-1045-5). As of March 9, 2016, his publications have been cited over 96,000 times, and he has an h-index of 78.[3]

See also

References

  1. ^ Crane, Linda. "In Memoriam: David S. Johnson". Columbia University Computer Science. Columbia University. Retrieved 9 March 2016.
  2. ^ "David S. Johnson Named 2010 Knuth Prize Winner for Innovations that Impacted the Foundations of Computer Science" (Press release). Association for Computing Machinery.
  3. ^ "David S. Johnson - Google Scholar Citations". scholar.google.com. Retrieved 2016-03-09.