What is he best known for?
The fields of study he is best known for:
- Programming language
- Algorithm
- Operating system
Guy E. Blelloch mostly deals with Parallel computing, Parallel algorithm, Theoretical computer science, NESL and Programming language.
In general Parallel computing, his work in Cache is often linked to Sparse matrix linking many areas of study.
The Parallel algorithm study combines topics in areas such as Parallel programming model and Bowyer–Watson algorithm, Delaunay triangulation.
His study in Theoretical computer science is interdisciplinary in nature, drawing from both Graph, Data structure, Graph and Computation.
In his study, Computer programming is inextricably linked to Parallel language, which falls within the broad field of NESL.
His work on Software portability, Programming paradigm and Programmer as part of his general Programming language study is frequently connected to Key, thereby bridging the divide between different branches of science.
His most cited work include:
- GraphChi: large-scale graph computation on just a PC (799 citations)
- Ligra: a lightweight graph processing framework for shared memory (520 citations)
- Vector models for data-parallel computing (453 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of investigation include Parallel computing, Parallel algorithm, Algorithm, Theoretical computer science and Data structure.
In his research on the topic of Parallel computing, Distributed computing is strongly related with Scheduling.
His research investigates the connection between Parallel algorithm and topics such as Combinatorics that intersect with problems in Sequential algorithm.
His Algorithm study combines topics from a wide range of disciplines, such as Graph and Binary number.
Guy E. Blelloch interconnects Programming language, Data type, Algorithm design, Correctness and Set in the investigation of issues within Theoretical computer science.
His Data structure research integrates issues from Discrete mathematics, Binary logarithm, Tree structure and Concurrency.
He most often published in these fields:
- Parallel computing (38.25%)
- Parallel algorithm (27.37%)
- Algorithm (23.51%)
What were the highlights of his more recent work (between 2017-2021)?
- Data structure (17.89%)
- Parallel algorithm (27.37%)
- Parallel computing (38.25%)
In recent papers he was focusing on the following fields of study:
Guy E. Blelloch mainly focuses on Data structure, Parallel algorithm, Parallel computing, Theoretical computer science and Algorithm.
His biological study spans a wide range of topics, including Tree structure, Speedup and Concurrency.
His Parallel algorithm study combines topics in areas such as Binary logarithm, Sorting, Connectivity, Auxiliary memory and Intersection.
His Parallel computing research includes elements of Scalability, Computational geometry and State.
His Theoretical computer science research incorporates themes from Algorithm design and Set.
He has included themes like Graph and Parallelism in his Algorithm study.
Between 2017 and 2021, his most popular works were:
- Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable (43 citations)
- Low-latency graph streaming using compressed purely-functional trees (18 citations)
- Delay-Free Concurrency on Faulty Persistent Memory (17 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Algorithm
- Operating system
Parallel algorithm, Parallel computing, Data structure, Graph and Binary logarithm are his primary areas of study.
His research integrates issues of Overhead, Sorting, Connectivity, Auxiliary memory and Intersection in his study of Parallel algorithm.
His Parallel computing study incorporates themes from Scalability and Process.
His studies in Data structure integrate themes in fields like Tree, Set, Range tree and Binary tree.
He combines subjects such as Search tree and Purely functional with his study of Graph.
His work in Concurrency addresses subjects such as Isolation, which are connected to disciplines such as Theoretical computer science.
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.
