Biography:Donald B. Johnson

From HandWiki
Short description: American computer scientist
Donald B. Johnson
Born
Donald Bruce Johnson
DiedSeptember 10, 1994(1994-09-10) (aged 60)
NationalityAmerican
EducationCornell University
Occupationcomputer scientist
EmployerDartmouth College
Pennsylvania State University
Known forfounding chair, Dartmouth College computer science department
Notable work
d-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 d-ary heap data structure,[7]<ref>{{citation

| contribution = 3.2. d-heaps
| pages = 34–38
| publisher = Society for Industrial and Applied Mathematics
| series = CBMS-NSF Regional Conference Series in Applied Mathematics
| title = Data Structures and Network Algorithms
| volume = 44

References

  1. date from Author's thesis biographyJohnson, Donald B., Algorithms for shortest paths 
  2. Death date from author listing of Armen, Chris; Johnson, Donald B. (1996), "Deterministic leader election on the asynchronous QRQW PRAM", Parallel Processing Letters 6 (2): 247–250, doi:10.1142/S0129626496000248 .
  3. "Johnson's home page at Dartmouth as of 1997". Archived from the original on June 5, 1997. https://web.archive.org/web/19970605065724/http://www.cs.dartmouth.edu/faculty/johnson.html. Retrieved 2017-04-23. , retrieved 2011-01-04.
  4. 4.0 4.1 Gloor, P. A. (1997), "Acknowledgements", Elements of hypermedia design: techniques for navigation & visualization in cyberspace, Birkhäuser, p. xvii .
  5. 5.0 5.1 Donald Bruce Johnson at the Mathematics Genealogy Project.
  6. History of Computer Science at Dartmouth College , retrieved 2011-01-04.
  7. Johnson, D. B. (1975), "Priority queues with update and finding minimum spanning trees", Information Processing Letters 4 (3): 53–57, doi:10.1016/0020-0190(75)90001-0 .