David S. Johnson | |
|---|---|
| Born | David Stifler Johnson (1945-12-09)December 9, 1945 |
| Died | March 8, 2016(2016-03-08) (aged 70) |
| Nationality | American |
| Alma mater | |
| Known for | |
| Awards |
|
| Scientific career | |
| Fields | Computer science |
| Thesis | Near-Optimal Bin Packing Algorithms (1973) |
David Stifler Johnson (December 9, 1945 – March 8, 2016) was an Americancomputer scientist specializing inalgorithms andoptimization. He was the head of the Algorithms and Optimization Department ofAT&T Labs Research from 1988 to 2013, and was a visiting professor atColumbia University from 2014 to 2016.[1] He was awarded the 2010Knuth Prize.[2]
Johnson was born in 1945 in Washington, D.C.[1] He graduatedsumma cum laude fromAmherst College in 1967, then earned his S.M. fromMIT in 1968 and his Ph.D. fromMIT in 1973. All three of his degrees are inmathematics. He was inducted as aFellow of the Association for Computing Machinery in 1995, and as a member of theNational Academy of Engineering in 2016.
He was the coauthor ofComputers and Intractability: A Guide to the Theory of NP-Completeness (ISBN 0-7167-1045-5) along withMichael Garey. As of March 9, 2016, his publications have been cited over 96,000 times, and he has anh-index of 78.[3] Johnson died on March 8, 2016, at the age of 70.[1]
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
| P ≟ NP | This biographical article relating to acomputer scientist is astub. You can help Wikipedia byexpanding it. |
