Charles E. Leiserson

From SuperTech Wiki

Jump to: navigation, search


Charles E. Leiserson is Professor of Computer Science and Engineering in the Department of Electrical Engineering and Computer Science (EECS) at MIT and a Margaret MacVicar Faculty Fellow. He is a member of MIT's Computer Science and Artificial Intelligence Laboratory (CSAIL), a member of CSAIL's Theory of Computation Group (TOC), and head of its Supertech Research Group. Professor Leiserson is an ACM Fellow.

Contact Information

Professor Charles E. Leiserson
MIT Computer Science and Artificial Intelligence Laboratory
The Stata Center
32 Vassar Street 32-G768
Cambridge, MA 02139
Tel: 617.253.5833
Fax: 617.253.0415
Email: cel AT mit DOT edu

Additional Information

Brief Biography

Prof. Leiserson's research centers on the theory of parallel computing, especially as it relates to engineering reality. He wrote the first paper on systolic architectures with H.T. Kung and invented the retiming method for digital circuit optimization. He designed and led the implementation of the network architecture for the Connection Machine Model CM-5 Supercomputer produced by Thinking Machines Corporation, which incorporated the fat-tree interconnection network he developed at MIT. Fat-trees are now the preferred interconnect strategy for Infiniband technology. His textbook, Introduction to Algorithms, coauthored with Ronald L. Rivest and Thomas H. Cormen was named "Best 1990 Professional and Scholarly Book in Computer Science and Data Processing" by the Association of American Publishers. Currently in its third edition with an additional coauthor Clifford Stein, it has sold over 500,000 copies and, according to Citeseerx, is the second most cited publication in computer science. On leave from MIT as Director of System Architecture at the Internet start-up Akamai Technologies, he led the engineering team that developed a world-wide content-distribution network numbering over 20,000 servers. He introduced the notion of cache-oblivious algorithms, which exploit the memory hierarchy near optimally while containing no tuning parameters for cache size or cache-line length. He developed the Cilk multithreaded programming technology, which featured the first provably efficient work-stealing scheduler. He led the development of several Cilk-based parallel chess-playing programs which have won numerous prizes in international competition. With his former student Matteo Frigo, he founded Cilk Arts, Inc., which developed the Cilk++ multicore concurrency platform and was acquired by Intel Corporation in 2009. He was for many years the head of the computer-science program for the Singapore-MIT Alliance distance-education collaboration. His annual workshop on Leadership Skills for Engineering and Science Faculty, cotaught with Chuck McVinney, has educated hundreds of faculty at MIT and around the world in the nontechnical issues involved in leading technical teams in academia. He is a Margaret MacVicar Faculty Fellow at MIT, the highest recognition at MIT for undergraduate teaching. He is an ACM Fellow and a senior member of IEEE and SIAM.

Interested in information about Professor Leiserson's textbook Introduction to Algorithms?

Interested in Professor Leiserson's workshop on Leadership Skills for Engineering and Science Faculty?

Personal tools
Members Only
Off Topic