Donald B. Johnson Explained

Donald B. Johnson
Birth Name:Donald Bruce Johnson
Birth Date:December 16, 1933
Nationality:American
Occupation:computer scientist
Education:Cornell University
Employer:Dartmouth College
Pennsylvania State University
Known For:founding chair, Dartmouth College computer science department
Notable Works:-ary heap data structure
Johnson's algorithm

Donald Bruce Johnson (December 16, 1933 – September 10, 1994)[1] [2] [3] was an American computer scientist, a researcher in the design and analysis of algorithms, and the founding chair of the computer science department at Dartmouth College.[4]

Johnson received his Ph.D. from Cornell University in 1973 under the supervision of David Gries.[5] He took a faculty position in the computer science department at Pennsylvania State University, and later moved to the department of mathematics at Dartmouth.[5] When the Dartmouth computer science department was founded in 1994,[6] he became its first chair.[4]

Johnson invented the -ary heap data structure,[7] [8] and is also known for Johnson's algorithm for the all-pairs shortest path problem.[9] [10]

Notes and References

  1. date from Author's thesis biography
  2. Death date from author listing of .
  3. Web site: Johnson's home page at Dartmouth as of 1997 . 2017-04-23 . bot: unknown . https://web.archive.org/web/19970605065724/http://www.cs.dartmouth.edu/faculty/johnson.html . June 5, 1997 ., retrieved 2011-01-04.
  4. .
  5. .
  6. http://www.cs.dartmouth.edu/about.php History of Computer Science at Dartmouth College
  7. .
  8. .
  9. .
  10. . Section 25.3, "Johnson's algorithm for sparse graphs", pp. 636–640.