| 词条 | Michael Fredman |
| 释义 |
| name = Michael Lawrence Fredman | image = | caption = | birth_date = | birth_place = | death_date = | death_place = | residence = | nationality = U.S. | field = Computer Science | work_institution = Rutgers University | alma_mater = | doctoral_advisor = Donald Knuth | doctoral_students = Michael Fellows 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.[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 {{math|Θ(n log n)}} is the optimal time for solving Klee's measure problem in a joint work with Bruce Weide. References1. ^{{MathGenealogy|id=40756|name=Michael Fredman}} {{Authority control}}{{DEFAULTSORT:Fredman, Michael}}2. ^MIT Mathematics Faculty: Members of the Mathematics Faculty since the founding of the Institute. 3. ^UCSD Mathematics: Department History {{webarchive|url=https://web.archive.org/web/20081028083525/http://math.ucsd.edu/about/history/ |date=2008-10-28 }}. 8 : Year of birth missing (living people)|Living people|American computer scientists|Theoretical computer scientists|Stanford University alumni|Massachusetts Institute of Technology faculty|University of California, San Diego faculty|Rutgers University faculty |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。