Michael Fredman: Difference between revisions
m +cat; remove big pointless image |
m Moving from Category:Theoretical computer scientists to Category:American theoretical computer scientists using Cat-a-lot |
||
(32 intermediate revisions by 21 users not shown) | |||
Line 1: | Line 1: | ||
{{short description|American computer scientist}} |
|||
{{Infobox_Scientist |
|||
{{Infobox scientist |
|||
| name = Michael Lawrence Fredman |
| name = Michael Lawrence Fredman |
||
| image = |
| image = |
||
Line 7: | Line 9: | ||
| death_date = |
| death_date = |
||
| death_place = |
| death_place = |
||
| residence = |
| residence = |
||
| nationality = |
| nationality = [[United States|U.S.]] |
||
| field = [[Computer Science]] |
| field = [[Computer Science]] |
||
| work_institution = [[Rutgers University]] |
| work_institution = [[Rutgers University]] |
||
| alma_mater = |
| alma_mater = [[Stanford University]] (PhD) |
||
| doctoral_advisor = [[Donald Knuth]] |
| doctoral_advisor = [[Donald Knuth]] |
||
| doctoral_students = [[Michael Fellows]]<br />[[John Iacono]] |
|||
| thesis_title = Growth Properties of a Class of Recursively Defined Functions |
|||
| thesis_year = 1972 |
|||
}} |
}} |
||
'''Michael Lawrence Fredman''' is an emeritus professor at the Computer Science Department at [[Rutgers University]], [[United States]]. He earned 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] {{webarchive|url=https://web.archive.org/web/20081028083525/http://math.ucsd.edu/about/history/ |date=2008-10-28 }}.</ref> Among his contributions to computer science are the development of the [[Fibonacci heap]] in a joint work with [[Robert Tarjan]], the [[transdichotomous model]] of integer computing with [[Dan Willard]], 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== |
|||
{{Reflist}} |
|||
{{Authority control}} |
|||
'''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. 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. |
|||
==External links== |
|||
* [http://genealogy.math.ndsu.nodak.edu/id.php?id=40756 Michael Fredman] at the [[Mathematics Genealogy Project]] |
|||
{{ |
{{DEFAULTSORT:Fredman, Michael}} |
||
[[Category:Year of birth missing (living people)]] |
|||
[[Category:Living people]] |
|||
[[Category:American computer scientists]] |
[[Category:American computer scientists]] |
||
[[Category: |
[[Category:American theoretical computer scientists]] |
||
[[Category:Stanford University alumni]] |
[[Category:Stanford University alumni]] |
||
[[Category:Massachusetts Institute of Technology School of Science faculty]] |
|||
[[Category:University of California, San Diego faculty]] |
|||
[[Category:Rutgers University faculty]] |
[[Category:Rutgers University faculty]] |
Latest revision as of 06:24, 6 May 2024
Michael Lawrence Fredman | |
---|---|
Nationality | U.S. |
Alma mater | Stanford University (PhD) |
Scientific career | |
Fields | Computer Science |
Institutions | Rutgers University |
Thesis | Growth Properties of a Class of Recursively Defined Functions (1972) |
Doctoral advisor | Donald Knuth |
Doctoral students | Michael Fellows John Iacono |
Michael Lawrence Fredman is an emeritus professor at the Computer Science Department at Rutgers University, United States. He earned 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, the transdichotomous model of integer computing with Dan Willard, 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.