David S. Johnson
| David S. Johnson | |
|---|---|
| Born |
David Stifler Johnson December 9, 1945 Washington, D.C. |
| Died | March 8, 2016 (aged 70) |
| Nationality | American |
| Fields | Computer science |
| Alma mater | |
| Thesis | Near-Optimal Bin Packing Algorithms (1973) |
| Known for | |
| Notable awards |
|
|
Website http://davidsjohnson.net | |
David Stifler Johnson (December 9, 1945 – March 8, 2016) was 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 was a visiting professor at Columbia University from 2014 to 2016.[1] He was awarded the 2010 Knuth Prize.[2]
Johnson was born in 1945 in Washington, D.C..[1] He 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 was 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] Johnson died on March 8, 2016 at the age of 70.[1]
See also
References
- 1 2 3 Crane, Linda. "In Memoriam: David S. Johnson". Columbia University Computer Science. Columbia University. Retrieved 9 March 2016.
- ↑ "David S. Johnson Named 2010 Knuth Prize Winner for Innovations that Impacted the Foundations of Computer Science" (Press release). Association for Computing Machinery.
- ↑ "David S. Johnson - Google Scholar Citations". scholar.google.com. Retrieved 2016-03-09.