Thomas H. Cormen

Thomas H. Cormen[1] is the co-author of Introduction to Algorithms, along with Charles Leiserson, Ron Rivest, and Cliff Stein. In 2013, he published a new book titled Algorithms Unlocked. He is a professor of computer science at Dartmouth College and former Chairman of the Dartmouth College Department of Computer Science. Between 2004 and 2008 he directed the Dartmouth College Writing Program.[2] His research interests are algorithm engineering, parallel computing, speeding up computations with high latency.

Thomas H. Cormen
Born1956
New York City
NationalityAmerican
Alma materMassachusetts Institute of Technology
Princeton University
Scientific career
FieldsComputer Science
InstitutionsDartmouth College
Doctoral advisorCharles E. Leiserson

Early life and education

Thomas H. Cormen was born in New York City in 1956. He grew up in Oceanside, New York.

He received his bachelor's degree summa cum laude in Electrical Engineering and Computer Science from Princeton University in June 1978.[3]

He then went to the Massachusetts Institute of Technology, where he earned his master's degree in Electrical Engineering and Computer Science in May 1986 with a thesis on "Concentrator Switches for Routing Messages in Parallel Computers"[3] and his PhD with a thesis on "Virtual Memory for Data-Parallel Computing"[4] in February 1993.[3]

From July 2004 through June 2008, he was the director of the Dartmouth Institute for Writing and Rhetoric.

Honors and awards

During his career he received several honors and awards:[3]

  • Elected to Phi Beta Kappa, Tau Beta Pi, Eta Kappa Nu.
  • National Science Foundation Fellowship.
  • Best Presentation Award, 1986 International Conference on Parallel Processing, St. Charles, Illinois.
  • Distinguished Presentation Award, 1987 International Conference on Parallel Processing, St. Charles, Illinois.
  • Professional and Scholarly Publishing Award in Computer Science and Data Processing, Association of American Publishers, 1990.
  • Dartmouth College Class of 1962 Faculty Fellowship, 1995–1996.
  • Jacobus Family Fellow, Dartmouth College, 1998–1999.
  • McLane Family Fellow, Dartmouth College, 2004–2005.

Bibliography
  • Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L. (1990). Introduction to Algorithms (first ed.). MIT Press and McGraw-Hill. ISBN 978-0-262-03141-7.CS1 maint: multiple names: authors list (link)
  • Cormen, Thomas H. (2002). Algorithmic Complexity. CRC Press.
  • Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001). Introduction to Algorithms (second ed.). MIT Press and McGraw-Hill. ISBN 978-0-262-53196-2.CS1 maint: multiple names: authors list (link)
  • Cormen, Thomas H.; Clara Lee; Erica Lin (2002). Instructor's Manual to Accompany Introduction to Algorithms, Second Edition (second ed.). MIT Press.
  • Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2009). Introduction to Algorithms (third ed.). MIT Press. ISBN 978-0-262-03384-8.CS1 maint: multiple names: authors list (link)
  • Cormen, Thomas H. (2009). Instructor's Manual to Accompany Introduction to Algorithms, Third edition (third ed.). MIT Press.
  • Cormen, Thomas H. (2013). Algorithms Unlocked (first ed.). MIT Press. ISBN 978-0-262-51880-2.

Notes
  1. The middle name is just 'H.'
  2. The actual title was:
    • 2004-2005: Director of the Dartmouth College Writing Program
    • 2005-2008: Chair of the Dartmouth College Writing Program
    • 2008: Director of the Dartmouth College Institute for Writing and Rhetoric
    • 2008: Chair of the Dartmouth College Writing and Rhetoric Program (the curricular component of the Institute)
  3. "Thomas H. Cormen profile" (PDF). cs.dartmouth.edu. Archived from the original (PDF) on June 6, 2011. Retrieved 2 September 2012.
  4. "Thomas H. Cormen, Virtual Memory for Data-Parallel Computing, MIT, 1992" (PDF). cs.dartmouth.edu. Retrieved 2 September 2012.
gollark: Maybe I should restart my search engine project.
gollark: Does this work well in practice?
gollark: Can it predict cat frequency just from a URL?
gollark: Interesting.
gollark: D exists, don't know of an A.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.