Thomas N. Hibbard

Thomas Nathaniel Hibbard (March 14, 1929 – February 11, 2016) was an American mathematician and computer scientist.[1]

Thomas N. Hibbard received the B.S. degree in physics from Pacific University, Forest Grove, OR, in 1951, the M.S. degree in mathematics from the University of Illinois, Urbana, in 1954,[2] and the Ph.D. degree in mathematics from the University of California, Los Angeles, in 1966.[3]

From 1955 to 1958 T. N. Hibbard was a Scientific Programmer at the RAND Corporation, Santa Monica, CA, programming the JOHNNIAC, an early computer built by Rand, and from 1959 to 1965 a member of the research staff of the System Development Corporation, Santa Monica, CA, where he worked with Seymour Ginsburg and Joseph Ullian in automata theory and formal languages. Following a three-year visiting faculty appointment at the Catholic University of Salta, Argentina, he joined the University of Southern California, Los Angeles, as an Assistant Professor of Computer Science in 1970. He conducted research in searching, sorting, and data structures, helping to pioneer the field of analysis of algorithms.[H62][H63][4] In 1974, he started research with his then faculty colleague Armin B. Cremers, initiating the theory and applications of data spaces.[CH] In February 1976, he joined the staff of the Jet Propulsion Laboratory, Pasadena, CA, working on the Voyager, IRAS and Galileo projects until his retirement from JPL in 1986. At that time, he joined the Information Sciences Institute (ISI), Marina del Rey, CA, and did experimental research on parallel computing until 1989, when he returned to Salta, Argentina, to teach at the National University (UNSA).

Contributions to Computer Science

Hibbard was a co-inventor of the binary search tree. He first proposed the so-called Hibbard deletion for binary search trees, in which the node to be deleted is replaced by its successor .[5] Hibbard proposed one of several widely cited increment sequences for the Shellsort algorithm.

Selected publications
H62.Hibbard, Thomas N. (1962). "Some combinatorial properties of certain trees with applications to searching and sorting". Journal of the ACM. 9 (1): 13–28. doi:10.1145/321105.321108.
H63.Hibbard, Thomas N. (1963). "An Empirical Study of Minimal Storage Sorting". Communications of the ACM. 6 (5): 206–213. doi:10.1145/366552.366557.
CH.Cremers, Armin B.; Hibbard, Thomas N. (September 1978). "Formal Modeling of Virtual Machines". IEEE Transactions on Software Engineering. SE-4 (5).

References
  1. "Murió un destacado investigador y docente de la UNSa". Tribuno de Salta.
  2. University of Illinois Commencement Program, 1954, also listing his 1951 B.S., retrieved 2015-07-22.
  3. Thomas N. Hibbard at the Mathematics Genealogy Project
  4. Knuth, Donald (1997). "Section 6.2.2: Binary Tree Searching". Sorting and Searching. The Art of Computer Programming. 3 (2nd ed.). Addison-Wesley. p. 432. ISBN 978-0-201-89685-5.
  5. Sedgewick, Robert; Wayne, Kevin (2011). Algorithms (4th ed.). Addison-Wesley Professional. p. 410. ISBN 978-0-321-57351-3.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.