Suchergebnisse
Suchergebnisse:
Charles E. Leiserson is Professor of Computer Science and Engineering at MIT. He holds the position of Edwin Sibley Webster Professor in MIT 's Department of Electrical Engineering and Computer Science (EECS) .
- Karriere
- Schriften
- Weblinks
Leiserson schloss im Jahr 1975 sein Bachelor-Studium in den Bereichen Informatik und Mathematik an der Yale University ab. Seinen Doktor in Informatik schloss er 1981 an der Carnegie Mellon University ab, seine Doktorväter waren Hsiang-Tsung Kung (und Jon Bentley). Anschließend ging er an das Massachusetts Institute of Technology, wo er als Profess...
Thomas H. Cormen, Leiserson, Charles E.; Rivest, Ronald L.: Introduction to Algorithms. first edition Auflage. MIT Press and McGraw-Hill, 1990, ISBN 0-262-03141-8.Thomas H. Cormen, Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford: Introduction to Algorithms. 2. Auflage. MIT Press and McGraw-Hill, 2001, ISBN 0-262-53196-8.Thomas H. Cormen, Charles E. Leiserson, Ronald Rivest, Clifford Stein: Algorithmen – Eine Einführung, Oldenbourg, 2010. ISBN 978-3-486-59002-9Charles Leiserson Titelliste bei seinem Auftritt bei WMBR's Dinnertime Sampler, Radiosendung vom 27. Oktober 2004 (englisch)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.
5. Apr. 2021 · Charles E. Leiserson is Professor of Computer Science and Engineering at the Massachusetts Institute of Technology in Cambridge, Massachusetts, USA. He joined the faculty of MIT in 1981, where he is now the Edwin Sibley Webster Professor in MIT’s Electrical Engineering and Computer Science Department. He is former Associate ...
Articles 1–20. MIT - Cited by 102,739 - algorithms - computer science and engineering - graph drawing - parallel computing - performance engineering.
Leiserson pioneered the development of VLSI theory and has written many papers on VLSI algorithms, graph layout, and computer-aided design. His contributions include the divide-and-conquer method of graph layout and the retiming method for optimizing digital circuitry.
Charles E. Leiserson, the Edwin Sibley Webster Professor within the Department of EECS, recently received some tremendous news: Introduction to Algorithms, the textbook Leiserson coauthored with Tom Cormen,...
