||This article relies largely or entirely upon a single source. (July 2013)
Charles Eric Leiserson is a computer scientist, specializing in the theory of parallel computing and distributed computing, and particularly practical applications thereof; as part of this effort, he developed the Cilk multithreaded language. He invented the fat-tree interconnection network, a hardware-universal interconnection network used in many supercomputers, including the Connection Machine CM5, for which he was network architect. He helped pioneer the development of VLSI theory, including the retiming method of digital optimization with James B. Saxe and systolic arrays with H. T. Kung. He conceived of the notion of cache-oblivious algorithms, which are algorithms that have no tuning parameters for cache size or cache-line length, but nevertheless use cache near-optimally. He developed the Cilk language for multithreaded programming, which uses a provably good work-stealing algorithm for scheduling. Leiserson coauthored the standard algorithms textbook Introduction to Algorithms together with Thomas H. Cormen, Ronald L. Rivest, and Clifford Stein.
Leiserson received a B.S. degree in computer science and mathematics from Yale University in 1975, and a Ph.D. degree in computer science from Carnegie Mellon University in 1981, where his advisors were Jon Bentley and H. T. Kung.
He then joined the faculty of the Massachusetts Institute of Technology, where he is now a Professor. In addition, he is a principal in the Theory of Computation research group in the MIT Computer Science and Artificial Intelligence Laboratory, and he was formerly Director of Research and Director of System Architecture for Akamai Technologies. He was Founder and Chief Technology Officer of Cilk Arts, Inc., a start-up that developed Cilk technology for multicore computing applications. (Cilk Arts, Inc. was acquired by Intel in 2009.)
Leiserson's dissertation, Area-Efficient VLSI Computation, won the first ACM Doctoral Dissertation Award. In 1985, the National Science Foundation awarded him a Presidential Young Investigator Award. In 2006 he was inducted as a Fellow of the Association for Computing Machinery. In 2013 he was inducted as a Fellow of the American Association for the Advancement of Science. He received the 2014 Taylor L. Booth Education Award from the IEEE Computer Society "for worldwide computer science education impact through writing a best-selling algorithms textbook, and developing courses on algorithms and parallel programming."
- Adleman, Diffie, Hellman, Merkle, Rivest, Shamir (1996)
- Lempel, Ziv (1997)
- Bryant, Clarke, Emerson, McMillan (1998)
- Sleator, Tarjan (1999)
- Karmarkar (2000)
- Myers (2001)
- Franaszek (2002)
- Miller, Rabin, Solovay, Strassen (2003)
- Freund, Schapire (2004)
- Holzmann, Kurshan, Vardi, Wolper (2005)
- Brayton (2006)
- Buchberger (2007)
- Cortes, Vapnik (2008)
- Bellare, Rogaway (2009)
- Mehlhorn (2010)
- Samet (2011)
- Broder, Charikar, Indyk (2012)
- Blumofe, Leiserson (2013)