What is he best known for?
The fields of study he is best known for:
- 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.
His most cited work include:
- Introduction to Algorithms (14407 citations)
- Introduction to Algorithms, 2nd edition. (3723 citations)
- Introduction to Algorithms, third edition (2251 citations)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Parallel computing (40.10%)
- Cilk (19.32%)
- Algorithm (14.01%)
What were the highlights of his more recent work (between 2011-2021)?
- Parallel computing (40.10%)
- Work stealing (11.59%)
- Cilk (19.32%)
In recent papers he was focusing on the following fields of study:
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.
Between 2011 and 2021, his most popular works were:
- Cache-Oblivious Algorithms (138 citations)
- EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs (78 citations)
- Standards for graph algorithm primitives (71 citations)
In his most recent research, the most cited papers focused on:
- 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.
