Thomas H. Cormen

from Wikipedia, the free encyclopedia

Thomas H. Cormen (* 1956 in New York City ) is an American computer scientist.

Cormen studied computer science at Princeton University with a bachelor's degree in 1978 summa cum laude . He then worked as a systems and software engineer at Amdahl Corp., Caere Corp. and the Avera Corp. in Scotts Valley, California. From 1984 he continued his studies at the Massachusetts Institute of Technology (MIT) with a master’s degree in 1986 and a doctorate in 1993 with Charles Leiserson (Virtual Memory for Data-Parallel Computing). There he was co-author of the first edition of his textbook on algorithms (published in 1990) and in the summer of 1990 he worked for Thinking Machines Corp. He became Assistant Professor in 1992, Associate Professor in 1998 and Professor at Dartmouth College in 2004 .

He is known as the co-author of a standard work on algorithms with Ron Rivest , Charles Leiserson , Clifford Stein .


  • Thomas H. Cormen, Charles E. Leiserson, Ronald Rivest, Clifford Stein: Algorithmen - An Introduction , Oldenbourg, 2010. ISBN 978-3-486-59002-9
    • Original edition: Introduction to Algorithms, 3rd edition, MIT Press 2009
  • Algorithmic Complexity, CRC Press 2002
  • Algorithms unlocked, MIT Press 2013

Web links

Individual evidence

  1. Thomas H. Cormen in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used