Charles Leiserson receives ACM Kanellakis Award
April 16, 2014
The ACM credits Blumofe and Leiserson for developing provably efficient randomized “work-stealing” scheduling algorithms and Cilk, a small but powerful programming-language extension for multithreaded computing.
Leiserson is a CSAIL researcher who heads the lab's Supertech Research Group, which investigates the technologies that support scalable computing, including hardware, software, and theory. He is coauthor of Introduction to Algorithms, the widely used algorithms textbook, and he has developed multiple courses on algorithms and parallel programming.
Leiserson was recognized with the first ACM Doctoral Dissertation Award and was recently selected for the IEEE Computer Society’s 2014 Taylor L. Booth Award for his contributions to computer-science education. He is an ACM Fellow, an AAAS Fellow, and a senior member of both IEEE and SIAM.
Read more on the EECS website: https://www.eecs.mit.edu/news-events/media/blumofe-and-leiserson-selected-acm-2013-kanellakis-theory-and-practice-award