Katana VentraIP

Charles E. Leiserson

Charles Eric Leiserson (born 1953) is a computer scientist and professor at Massachusetts Institute of Technology (M.I.T.). He specializes in the theory of parallel computing and distributed computing.

Charles E. Leiserson

(1953-11-10) November 10, 1953[1]

Area-Efficient VLSI Computation  (1981)

Education[edit]

Leiserson received a Bachelor of Science degree in computer science and mathematics from Yale University in 1975 and a PhD degree in computer science from Carnegie Mellon University in 1981, where his advisors were Jon Bentley and H. T. Kung.[2] Leiserson's dissertation, Area-Efficient VLSI Computation, won the first ACM Doctoral Dissertation Award in 1982.

1981 ’s Doctoral Thesis Award.[6]

Fannie and John Hertz Foundation

1982 for his Ph.D. thesis, Area-Efficient VLSI Computation

ACM Doctoral Dissertation Award

1985 awarded him Presidential Young Investigator Award.

National Science Foundation

2007 elected Faculty Fellow at MIT, the highest recognition at MIT for undergraduate teaching.[7]

Margaret MacVicar

2013 from ACM, with his PhD student Robert D. Blumofe, for "contributions to robust parallel and distributed computing", in particular the work-stealing scheduling and the Cilk research.[8]

Paris Kanellakis Award

2014 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."[9]

Taylor L. Booth

2014 from ACM-IEEE Computer Society for his "enduring influence on parallel computing systems and their adoption into mainstream use through scholarly research and development." He was also cited for "distinguished mentoring of computer science leaders and students."[5]

Ken Kennedy Award

Personal life[edit]

His father was Mark Leiserson, a professor of economics at Yale University.[10]

Home page