What is he best known for?
The fields of study he is best known for:
- Artificial intelligence
- Algorithm
- Programming language
John E. Hopcroft focuses on Combinatorics, Discrete mathematics, Theoretical computer science, Algorithm and Automata theory.
His research investigates the connection with Combinatorics and areas like Decidability which intersect with concerns in Reachability, Set theory, Petri net and Mathematical logic.
As a part of the same scientific study, he usually deals with the Discrete mathematics, concentrating on Set and frequently concerns with Tracking, Structure, The Internet, Data set and Dimension.
His Theoretical computer science research is multidisciplinary, incorporating elements of Sorting, Model of computation, Data structure and Analysis of algorithms.
John E. Hopcroft combines subjects such as Graph isomorphism, Queue, Function and Constant with his study of Algorithm.
His work carried out in the field of Automata theory brings together such families of science as Computability, Theory of computation and Range.
His most cited work include:
- Introduction to Automata Theory, Languages, and Computation (10835 citations)
- The Design and Analysis of Computer Algorithms (7880 citations)
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs (2331 citations)
What are the main themes of his work throughout his whole career to date?
John E. Hopcroft mainly investigates Artificial intelligence, Discrete mathematics, Combinatorics, Theoretical computer science and Algorithm.
His Artificial intelligence study integrates concerns from other disciplines, such as Machine learning, Community structure and Pattern recognition.
His work investigates the relationship between Machine learning and topics such as Structure that intersect with problems in Data science.
The study incorporates disciplines such as Nondeterministic finite automaton, Two-way deterministic finite automaton and Automaton in addition to Discrete mathematics.
John E. Hopcroft is interested in Nested word, which is a branch of Theoretical computer science.
John E. Hopcroft does research in Algorithm, focusing on Time complexity specifically.
He most often published in these fields:
- Artificial intelligence (23.98%)
- Discrete mathematics (23.98%)
- Combinatorics (19.51%)
What were the highlights of his more recent work (between 2014-2021)?
- Artificial intelligence (23.98%)
- Machine learning (10.16%)
- Artificial neural network (5.69%)
In recent papers he was focusing on the following fields of study:
Artificial intelligence, Machine learning, Artificial neural network, Pattern recognition and Representation are his primary areas of study.
John E. Hopcroft usually deals with Artificial intelligence and limits it to topics linked to Network architecture and Maxima and minima and Randomness.
John E. Hopcroft interconnects Test data, Structure, Community structure and Robustness in the investigation of issues within Machine learning.
John E. Hopcroft has included themes like Layer, Single image, Linear subspace and Residual in his Artificial neural network study.
His work is dedicated to discovering how Representation, Spectral clustering are connected with Bounding overwatch, Heuristics and Theoretical computer science and other disciplines.
Theoretical computer science and Algorithmics are commonly linked in his work.
Between 2014 and 2021, his most popular works were:
- Stacked Generative Adversarial Networks (280 citations)
- Snapshot Ensembles: Train 1, get M for free (223 citations)
- Foundations of Data Science (120 citations)
In his most recent research, the most cited papers focused on:
- Artificial intelligence
- Algorithm
- Programming language
His primary areas of study are Artificial intelligence, Machine learning, Artificial neural network, Representation and Pattern recognition.
His Artificial intelligence study incorporates themes from Manifold, Structure and Linear subspace.
His Machine learning study combines topics from a wide range of disciplines, such as Network architecture, Single node, Community structure and Robustness.
In general Artificial neural network study, his work on Supervised learning often relates to the realm of Gaussian, thereby connecting several areas of interest.
In his research on the topic of Pattern recognition, Conditional entropy, Entropy, Entropy and Discriminative model is strongly related with Generative model.
His study in Spectral clustering is interdisciplinary in nature, drawing from both Closeness, Theoretical computer science and Bounding overwatch.
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.
