An Entity of Type: animal, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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. He was a member of the mathematics department at the Massachusetts Institute of Technology from 1974 to 1976. and of the Computer Science and Engineering department at the University of California, San Diego until 1992. 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.

Property Value
dbo:abstract
  • Michael Fredman Lawrence es un profesor del Departamento de Ciencias de la Computación en la Universidad de Rutgers, Estados Unidos. Obtuvo su grado de Doctorado de la Universidad de Stanford en 1972, bajo la supervisión de Donald Knuth.​ Fue miembro del departamento de matemáticas en el Instituto Tecnológico de Massachusetts de 1974 a 1976 y de las Ciencias Computacionales y el departamento de Ingeniería en la Universidad de California, San Diego hasta 1992.​​ Entre sus contribuciones a la informática son el desarrollo del montículo de Fibonacci en un trabajo conjunto con Robert Tarjan y la prueba de un límite inferior (o minorante) que muestra que (N log n) es el tiempo óptimo para la resolución del problema de la medida de Klee en un trabajo conjunto con Bruce Weide. (es)
  • 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. He was a member of the mathematics department at the Massachusetts Institute of Technology from 1974 to 1976. and of the Computer Science and Engineering department at the University of California, San Diego until 1992. 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. (en)
dbo:academicDiscipline
dbo:doctoralAdvisor
dbo:doctoralStudent
dbo:nationality
dbo:wikiPageID
  • 19731704 (xsd:integer)
dbo:wikiPageLength
  • 2433 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1086425974 (xsd:integer)
dbo:wikiPageWikiLink
dbp:doctoralAdvisor
dbp:doctoralStudents
dbp:field
dbp:name
  • Michael Lawrence Fredman (en)
dbp:nationality
dbp:thesisTitle
  • Growth Properties of a Class of Recursively Defined Functions (en)
dbp:thesisYear
  • 1972 (xsd:integer)
dbp:wikiPageUsesTemplate
dbp:workInstitution
dcterms:subject
rdf:type
rdfs:comment
  • Michael Fredman Lawrence es un profesor del Departamento de Ciencias de la Computación en la Universidad de Rutgers, Estados Unidos. Obtuvo su grado de Doctorado de la Universidad de Stanford en 1972, bajo la supervisión de Donald Knuth.​ Fue miembro del departamento de matemáticas en el Instituto Tecnológico de Massachusetts de 1974 a 1976 y de las Ciencias Computacionales y el departamento de Ingeniería en la Universidad de California, San Diego hasta 1992.​​ Entre sus contribuciones a la informática son el desarrollo del montículo de Fibonacci en un trabajo conjunto con Robert Tarjan y la prueba de un límite inferior (o minorante) que muestra que (N log n) es el tiempo óptimo para la resolución del problema de la medida de Klee en un trabajo conjunto con Bruce Weide. (es)
  • 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. He was a member of the mathematics department at the Massachusetts Institute of Technology from 1974 to 1976. and of the Computer Science and Engineering department at the University of California, San Diego until 1992. 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. (en)
rdfs:label
  • Michael Fredman (en)
  • Michael Fredman (es)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
foaf:name
  • Michael Lawrence Fredman (en)
is dbo:doctoralAdvisor of
is dbo:doctoralStudent of
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is dbp:doctoralAdvisor of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License