Charles E. Leiserson

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


Leiserson closed in 1975, his Bachelor's degree in computer science and mathematics at Yale University from. His doctorate in computer science, he joined in 1981 at Carnegie Mellon University as doctoral supervisors he had this Jon Bentley and HT Kung.

He then went to the Massachusetts Institute of Technology, where he is a professor. In addition, he is a leader in the group Theory of Computation research group at MIT Computer Science and Artificial Intelligence Laboratory. He was also head of the research department of Akamai and founded the company Cilk Arts, Inc., where he works as a technical director. Clik Arts is a start- up company which develops Cilk, a programming language for multithreaded programming, which a good work -stealing algorithm uses proven for process scheduling. The fat tree network topology designed by him, this is in many super computers use, such as the Connection Machine CM5. In developing this same computer, he worked as a network architect. He is also a pioneer in the development of VLSI theory, including the retiming method of digital optimization with James B. Saxe and systolic arrays with HT Kung.

His dissertation Area- Efficient VLSI Computation, was the first, which won the Association for Computing Machinery (ACM ) Doctoral Dissertation Award. In 1985, the National Science Foundation awarded him the Presidential Award Young Investigator Award. In 2006 he was elected a Fellow of the ACM.

Together with Thomas H. Cormen, Ronald Rivest, and Clifford Stein, he has written the standard work for the Introduction to Algorithms Introduction to Algorithms. He has also developed the idea of ​​a cache- oblivious algorithm which exploits the cache nearly optimal without tuning parameters such as cache size and cache line length.


  • Thomas H. Cormen, Leiserson, Charles E.; Rivest, Ronald L.: Introduction to Algorithms, first 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, second edition, MIT Press and McGraw -Hill, 2001, ISBN 0-262-53196-8.
  • Thomas H. Cormen, Charles E. Leiserson, Ronald Rivest, Clifford Stein: Algorithms - An Introduction. , 2010. ISBN 978-3-486-59002-9