Charles E. Leiserson is a computer scientist, professor at the Massachusetts Institute of Technology, principal in the Theory of Computation research group at MIT, inventor of the fat-tree interconnection network, developer of Cilk programming language, and network architect for the Connection Machine CM5. He earned a B.S. in computer science and mathematics from Yale University and Ph.D. in computer science from Carnegie Mellon University.
He is a pioneer in the development of VLSI theory, having worked on retiming methods of digital optimization and systolic arrays. He founded Cilk Arts, Inc, which was later acquired by Intel.
Perhaps best well known for introducing the idea of cache-oblivious algorithms – featuring no tuning parameters for size or line-length – which somehow still use cache at near optimal levels. He also co-authored the most common introductory textbook on algorithms, Introduction to Algorithms, with colleagues Thomas Cormen, Ronald Rivest, and Clifford Stein.
He was awarded the National Science Foundation’s Presidential Young Investigator Award in 1985 and the Taylor L. Booth Education Award from the IEEE Computer Society in 2014. Leiserson is a fellow of the Institute of Electrical and Electronics Engineers, the Society for Industrial and Applied Mathematics, the American Association for the Advancement of Science and the Association for Computing Machinery.
Featured in Top Influential Computer Scientists Today
Research university in Cambridge, Massachusetts, United Statesview profile
Private research university in Pittsburgh, Pennsylvania, United Statesview profile
Private research university in New Haven, Connecticut, United Statesview profile