Charles E. Leiserson

from Wikipedia, the free encyclopedia
Charles E. Leiserson, 2011

Charles Eric Leiserson (born November 12, 1953 ) is an American researcher in the field of computer science . He researches primarily in the areas of parallel computers and distributed computing as well as practical applications for this.


Leiserson concluded in 1975 his Bachelor -Studies in the fields of computer science and mathematics at Yale University from. He received his doctorate in computer science from Carnegie Mellon University in 1981, his PhD supervisors were Hsiang-Tsung Kung (and Jon Bentley ).

He then went to the Massachusetts Institute of Technology , where he is a professor . In addition, he is a leader in the Theory of Computation research Group at the MIT Computer Science and Artificial Intelligence Laboratory . He was also the head of research at Akamai and founded Cilk Arts, Inc. where he serves as technical director. Cilk Arts is a start-up company which Cilk developed a programming language for multithreaded programming that are proven to have a good work stealing algorithm for process scheduling used. The company that Cilk developed under license from MIT, where Cilk originally originated, was acquired by Intel in 2009 . The fat tree - network topology developed by him, this is in many supercomputers use, such as the Connection Machine CM5 . He worked as a network architect when developing this computer. He is also considered a pioneer in the development of the VSLI theory, including the retiming method of digital optimization together with James B. Saxe and systolic arrays together with HT Kung (1978).

His doctoral thesis, Area-Efficient VLSI Computation , was the first to win the Association for Computing Machinery (ACM) Doctoral Dissertation Award . 1985 awarded him the National Science Foundation award Presidential Young Investigator Award . In 2006 he became a Fellow of the ACM. For 2013 he was awarded the Paris Kanellakis Prize together with Robert D. Blumofe , with whom he had developed the work stealing algorithms . In 2016 he was elected to the National Academy of Engineering .

Together with Thomas H. Cormen , Ronald Rivest and Clifford Stein , he wrote the standard work for the introduction to algorithms Introduction to Algorithms . He also developed the idea of ​​a cache-oblivious algorithm, which uses the cache almost optimally without tuning parameters such as cache size and cacheline length.


  • Thomas H. Cormen, Leiserson, Charles E .; Rivest, Ronald L .: Introduction to Algorithms , first edition. Edition, MIT Press and McGraw-Hill, 1990, ISBN 0-262-03141-8 .
  • Thomas H. Cormen, Leiserson, Charles E .; Rivest, Ronald L .; Stein, Clifford: Introduction to Algorithms , 2nd Edition, MIT Press and McGraw-Hill, 2001, ISBN 0-262-53196-8 .
  • Thomas H. Cormen, Charles E. Leiserson, Ronald Rivest, Clifford Stein: Algorithmen - An Introduction , Oldenbourg, 2010. ISBN 978-3-486-59002-9

Web links