- Home
- Best Scientists - Computer Science
- Charles E. Leiserson

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
64
Citations
96,603
173
World Ranking
1565
National Ranking
869

2016 - Member of the National Academy of Engineering For theoretically grounded approaches to digital design and parallel computer systems.

2016 - IEEE Fellow For leadership in parallel and distributed computing

2015 - SIAM Fellow For enduring influence on parallel computing systems and their adoption into mainstream use through scholarly research and development.

2014 - ACM - IEEE CS Ken Kennedy Award For enduring influence on parallel computing systems and their adoption into mainstream use through scholarly research and development and for distinguished mentoring of computer science leaders and students.

2013 - Fellow of the American Association for the Advancement of Science (AAAS)

2013 - ACM Paris Kanellakis Theory and Practice Award For contributions to efficient and robust parallel computation through both provably efficient randomized scheduling protocols and a set of parallel-language primitives constituting the Cilk framework. Implementations of these protocols and conceptual framework have been deployed on scores of millions of machines and therefore enjoy daily impact.

2006 - ACM Fellow For contributions to parallel and distributed computing.

- Operating system
- Programming language
- Computer network

Charles E. Leiserson mostly deals with Parallel computing, Cilk, Algorithm, Work stealing and Scheduling. His Parallel computing research incorporates themes from Very-large-scale integration, Operating system, Matrix multiplication and Computation. His Cilk study incorporates themes from Multithreading, Compiler and Runtime system.

The concepts of his Algorithm study are interwoven with issues in Transpose, Probabilistic analysis of algorithms and Data structure. His work in Probabilistic analysis of algorithms addresses subjects such as Pseudocode, which are connected to disciplines such as Divide and conquer algorithms. His Scheduling research is multidisciplinary, incorporating elements of Intel Paragon and Programmer.

- Introduction to Algorithms (14407 citations)
- Introduction to Algorithms, 2nd edition. (3723 citations)
- Introduction to Algorithms, third edition (2251 citations)

Parallel computing, Cilk, Algorithm, Very-large-scale integration and Theoretical computer science are his primary areas of study. His Parallel computing research incorporates elements of Scheduling, Work stealing, Thread and Compiler. Charles E. Leiserson regularly ties together related areas like Data structure in his Work stealing studies.

His work deals with themes such as Multithreading, Concurrency and Runtime system, which intersect with Cilk. He regularly links together related areas like Cache-oblivious algorithm in his Algorithm studies. His Very-large-scale integration study also includes

- Interconnection that connect with fields like Supercomputer,
- Chip together with Set.

- Parallel computing (40.10%)
- Cilk (19.32%)
- Algorithm (14.01%)

- Parallel computing (40.10%)
- Work stealing (11.59%)
- Cilk (19.32%)

Charles E. Leiserson spends much of his time researching Parallel computing, Work stealing, Cilk, Computation and Theoretical computer science. His Parallel computing research is multidisciplinary, relying on both Multithreading, Divide and conquer algorithms, Directed graph, Directed acyclic graph and Multigraph. His studies deal with areas such as Discrete mathematics, Tree, Combinatorics, Dynamic data and Data structure as well as Computation.

His research integrates issues of Parallel algorithm and Algorithm in his study of Discrete mathematics. His studies in Algorithm integrate themes in fields like Very-large-scale integration and String searching algorithm. His Data structure study integrates concerns from other disciplines, such as Global variable and Scheduling.

- Cache-Oblivious Algorithms (138 citations)
- EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs (78 citations)
- Standards for graph algorithm primitives (71 citations)

- Operating system
- Programming language
- Computer network

His scientific interests lie mostly in Theoretical computer science, Parallel computing, Cilk, Graph and Deep learning. His Theoretical computer science research includes themes of Graph theory, State, Graph algorithms and Linear algebra. Charles E. Leiserson has included themes like Multithreading and Concurrency in his Parallel computing study.

His Multithreading research focuses on Runtime system and how it relates to Porting, Work stealing and Pipeline. His Cilk study is concerned with Multi-core processor in general. His work carried out in the field of Programming language brings together such families of science as Algorithm, Loop scheduling and Deductive reasoning.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Introduction to Algorithms

Thomas T. Cormen;Charles E. Leiserson;Ronald L. Rivest.

**(1990)**

61022 Citations

Introduction to Algorithms

Thomas T. Cormen;Charles E. Leiserson;Ronald L. Rivest.

**(1990)**

61022 Citations

Introduction to Algorithms, 2nd edition.

TH Cormen;CE Leiserson;RL Rivest;C Stein.

**(2001)**

6709 Citations

Cilk: An Efficient Multithreaded Runtime System

Robert D. Blumofe;Christopher F. Joerg;Bradley C. Kuszmaul;Charles E. Leiserson.

Journal of Parallel and Distributed Computing **(1996)**

5384 Citations

Cilk: An Efficient Multithreaded Runtime System

Robert D. Blumofe;Christopher F. Joerg;Bradley C. Kuszmaul;Charles E. Leiserson.

Journal of Parallel and Distributed Computing **(1996)**

5384 Citations

Introduction to Algorithms, third edition

Thomas H. Cormen;Charles E. Leiserson;Ronald L. Rivest;Clifford Stein.

**(2009)**

3724 Citations

Introduction to Algorithms, third edition

Thomas H. Cormen;Charles E. Leiserson;Ronald L. Rivest;Clifford Stein.

**(2009)**

3724 Citations

Scheduling multithreaded computations by work stealing

Robert D. Blumofe;Charles E. Leiserson.

Journal of the ACM **(1999)**

2723 Citations

Scheduling multithreaded computations by work stealing

Robert D. Blumofe;Charles E. Leiserson.

Journal of the ACM **(1999)**

2723 Citations

Introduction to Algorithms, Second Edition

Ronald L. Rivest;Charles E. Leiserson;Thomas H. Cormen;Clifford Stein.

**(2001)**

1980 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

MIT

Columbia University

Microsoft (United States)

Stony Brook University

Tel Aviv University

Duke University

University of California, Berkeley

Carnegie Mellon University

Tel Aviv University

Federal University of Campina Grande

Rice University

University of Manchester

National University of Singapore

University of California, Berkeley

Singapore Management University

University of Minnesota

University of New England

University of Wisconsin–Madison

China Agricultural University

University of Amsterdam

University College London

University of Toronto

Florida State University

University of North Carolina at Greensboro

Peking University

Something went wrong. Please try again later.