Jump to content

Michael Fredman

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 24.239.168.39 (talk) at 01:29, 24 April 2011 (added doctoral students). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Michael Lawrence Fredman
Scientific career
FieldsComputer Science
InstitutionsRutgers University
Doctoral advisorDonald Knuth
Doctoral studentsMichael Fellows
Bing Xiao
Haripriyan Hampapuram
John Iacono
Amr Elmasry

Michael Lawrence Fredman is a professor at the Computer Science Department at Rutgers University, United States. He got his Ph. D. degree from Stanford University in 1972 under the supervision of Donald Knuth.[1] He was a member of the mathematics department at the Massachusetts Institute of Technology from 1974 to 1976.[2] and of the Computer Science and Engineering department at the University of California, San Diego until 1992.[3] Among his contributions to computer science are the development of the Fibonacci heap in a joint work with Robert Tarjan and the proof of a lower bound showing that Θ(n log n) is the optimal time for solving Klee's measure problem in a joint work with Bruce Weide.

References

  1. ^ Michael Fredman at the Mathematics Genealogy Project
  2. ^ MIT Mathematics Faculty: Members of the Mathematics Faculty since the founding of the Institute.
  3. ^ UCSD Mathematics: Department History.

Template:Persondata

Retrieved from "https://en.wikipedia.org/w/index.php?title=Michael_Fredman&oldid=425591024"