What is he best known for?
The fields of study he is best known for:
- Algorithm
- Operating system
- Programming language
Michael T. Goodrich mainly investigates Combinatorics, Algorithm, Theoretical computer science, Discrete mathematics and Data structure.
Michael T. Goodrich interconnects Planar, Parallel algorithm and Greedy algorithm in the investigation of issues within Combinatorics.
His work carried out in the field of Algorithm brings together such families of science as Upper and lower bounds, Simple and Closest pair of points problem.
His Theoretical computer science study combines topics in areas such as Cryptographic protocol, Algorithm design, Logarithm, Degree and Structure.
His work in the fields of Discrete mathematics, such as Planar graph, Graph drawing, Simplex graph and Factor-critical graph, intersects with other areas such as Greedy embedding.
His work deals with themes such as Tree, Monotone polygon and Point location, which intersect with Data structure.
His most cited work include:
- Almost optimal set covers in finite VC-dimension (376 citations)
- External-memory graph algorithms (293 citations)
- Data Structures and Algorithms in Java (255 citations)
What are the main themes of his work throughout his whole career to date?
Michael T. Goodrich mainly focuses on Combinatorics, Algorithm, Theoretical computer science, Discrete mathematics and Data structure.
His Combinatorics study often links to related topics such as Voronoi diagram.
His Algorithm study combines topics from a wide range of disciplines, such as Simple, Upper and lower bounds and Mathematical optimization.
His Theoretical computer science study integrates concerns from other disciplines, such as Set, Degree, Auxiliary memory, Hash function and Cuckoo hashing.
His Discrete mathematics study frequently links to other fields, such as Computational geometry.
His Data structure research is multidisciplinary, incorporating elements of Java and Point location.
He most often published in these fields:
- Combinatorics (35.29%)
- Algorithm (21.30%)
- Theoretical computer science (20.28%)
What were the highlights of his more recent work (between 2014-2021)?
- Combinatorics (35.29%)
- Algorithm (21.30%)
- Theoretical computer science (20.28%)
In recent papers he was focusing on the following fields of study:
Combinatorics, Algorithm, Theoretical computer science, Planar graph and Discrete mathematics are his primary areas of study.
His Combinatorics study incorporates themes from Straight skeleton and Planar.
His work in Algorithm tackles topics such as Voronoi diagram which are related to areas like Geometric primitive, Limit, Model of computation and Uniqueness.
His Theoretical computer science research focuses on Data structure and how it connects with Cuckoo hashing and Data retention.
The various areas that Michael T. Goodrich examines in his Planar graph study include Class, Dijkstra's algorithm, Node and Polynomial expansion.
As part of the same scientific family, he usually focuses on Set, concentrating on Sorting and intersecting with Parallel algorithm.
Between 2014 and 2021, his most popular works were:
- Cascading Divide-and-conquer: A Technique for Designing Parallel Algorithms (38 citations)
- Algorithm Design and Applications (26 citations)
- Fully-Dynamic Verifiable Zero-Knowledge Order Queries for Network Data. (11 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Operating system
- Programming language
His primary areas of study are Algorithm, Theoretical computer science, Combinatorics, Planar and Time complexity.
His research in Algorithm intersects with topics in Graph model, Random graph, Permutation graph and Digital watermarking.
He interconnects Bounded function, Verifiable secret sharing, Dimension and Zero-knowledge proof in the investigation of issues within Theoretical computer science.
Michael T. Goodrich works in the field of Combinatorics, namely Arboricity.
In his study, which falls under the umbrella issue of Planar, Arc, Differentiable function and Graph is strongly linked to Planarity testing.
His work carried out in the field of Time complexity brings together such families of science as Sorting, Sequence, Clique and Planar graph.
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.
