Michael Fredman: Difference between revisions
Content deleted Content added
Undo a second time. Still unimportant trivia. And you broke the <ref> tag by not closing it with </ref>. |
m fix bad line break |
||
| Line 14: | Line 14: | ||
| doctoral_advisor = [[Donald Knuth]] |
| doctoral_advisor = [[Donald Knuth]] |
||
}} |
}} |
||
'''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]].<ref>{{MathGenealogy|id=40756|name=Michael Fredman}}</ref> He was a member of the mathematics department at the [[Massachusetts Institute of Technology]] from 1974 to 1976.<ref>[http://www-math.mit.edu/about/history/faculty.html MIT Mathematics Faculty: Members of the Mathematics Faculty since the founding of the Institute].</ref> and of the Computer Science and Engineering department at the [[University of California, San Diego]] until 1992.<ref>[http://math.ucsd.edu/about/history/ UCSD Mathematics: Department History].</ref> 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'' |
'''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]].<ref>{{MathGenealogy|id=40756|name=Michael Fredman}}</ref> He was a member of the mathematics department at the [[Massachusetts Institute of Technology]] from 1974 to 1976.<ref>[http://www-math.mit.edu/about/history/faculty.html MIT Mathematics Faculty: Members of the Mathematics Faculty since the founding of the Institute].</ref> and of the Computer Science and Engineering department at the [[University of California, San Diego]] until 1992.<ref>[http://math.ucsd.edu/about/history/ UCSD Mathematics: Department History].</ref> 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 {{math|Θ(''n'' log ''n'')}} is the optimal time for solving [[Klee's measure problem]] in a joint work with Bruce Weide. |
||
==References== |
==References== |
||
Revision as of 19:29, 14 January 2011
Michael Lawrence Fredman | |
|---|---|
| Scientific career | |
| Fields | Computer Science |
| Institutions | Rutgers University |
| Doctoral advisor | Donald Knuth |
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.