Michael Lawrence Fredman is an emeritus professor at the Computer Science Department at

Rutgers University Rutgers University (; RU), officially Rutgers, The State University of New Jersey, is a public land-grant research university consisting of four campuses in New Jersey. Chartered in 1766, Rutgers was originally called Queen's College, and wa ...

United States The United States of America (U.S.A. or USA), commonly known as the United States (U.S. or US) or America, is a country primarily located in North America. It consists of 50 U.S. state, states, a Washington, D.C., federal district, five ma ...

. He earned his Ph.D. degree from Stanford University in 1972 under the supervision of

Donald Knuth Donald Ervin Knuth ( ; born January 10, 1938) is an American computer scientist, mathematician, and professor emeritus at Stanford University. He is the 1974 recipient of the ACM Turing Award, informally considered the Nobel Prize of computer ...

. He was a member of the mathematics department at the

Massachusetts Institute of Technology The Massachusetts Institute of Technology (MIT) is a Private university, private Land-grant university, land-grant research university in Cambridge, Massachusetts. Established in 1861, MIT has played a key role in the development of modern t ...

from 1974 to 1976. and of the Computer Science and Engineering department at the

University of California, San Diego The University of California, San Diego (UC San Diego or colloquially, UCSD) is a public university, public Land-grant university, land-grant research university in San Diego, California. Established in 1960 near the pre-existing Scripps Insti ...

until 1992.UCSD Mathematics: Department History
. Among his contributions to computer science are the development of the Fibonacci heap in a joint work with

Robert Tarjan Robert Endre Tarjan (born April 30, 1948) is an American computer scientist and mathematician. He is the discoverer of several graph algorithms, including Tarjan's off-line lowest common ancestors algorithm, and co-inventor of both splay trees a ...

, the

transdichotomous model In computational complexity theory, and more specifically in the analysis of algorithms with integer data, the transdichotomous model is a variation of the random access machine in which the machine word size is assumed to match the problem size. ...

of integer computing with

Dan Willard Dan Edward Willard is an American computer scientist and logician, and is a professor of computer science at the University at Albany. Education and career Willard did his undergraduate studies in mathematics at Stony Brook University, graduating ...

, and the proof of a

lower bound In mathematics, particularly in order theory, an upper bound or majorant of a subset of some preordered set is an element of that is greater than or equal to every element of . Dually, a lower bound or minorant of is defined to be an ele ...

showing that is the optimal time for solving Klee's measure problem in a joint work with Bruce Weide.

References

{{DEFAULTSORT:Fredman, Michael Year of birth missing (living people) Living people American computer scientists Theoretical computer scientists Stanford University alumni Massachusetts Institute of Technology School of Science faculty University of California, San Diego faculty Rutgers University faculty