What is he best known for?
The fields of study he is best known for:
- Programming language
- Algorithm
- Artificial intelligence
The scientist’s investigation covers issues in Theoretical computer science, Programming language, Database, Query language and Relational database.
His work on Automata theory is typically connected to Nested word as part of general Theoretical computer science study, connecting several disciplines of science.
His work on Compiler and Horn clause as part of general Programming language research is frequently linked to Schema, Forward chaining and Mediation system, bridging the gap between disciplines.
His Compiler research includes themes of Parsing and Lexical analysis.
Jeffrey D. Ullman has researched Query language in several fields, including Consistency, First normal form, Relation and Acyclic dependencies principle.
His work in the fields of Relational database, such as Relational algebra, overlaps with other areas such as Universal relation.
His most cited work include:
- Introduction to Automata Theory, Languages, and Computation (10835 citations)
- Compilers: Principles, Techniques, and Tools (6194 citations)
- Principles of database and knowledge-base systems (2340 citations)
What are the main themes of his work throughout his whole career to date?
His primary scientific interests are in Theoretical computer science, Algorithm, Discrete mathematics, Programming language and Database.
Jeffrey D. Ullman works mostly in the field of Theoretical computer science, limiting it down to topics relating to Set and, in certain cases, Data mining, as a part of the same area of interest.
His work on Parsing expands to the thematically related Algorithm.
His biological study spans a wide range of topics, including Deterministic pushdown automaton, Combinatorics and Pushdown automaton.
His Compiler and Syntax study are his primary interests in Programming language.
His Database and Database theory, View and Query language investigations all form part of his Database research activities.
He most often published in these fields:
- Theoretical computer science (24.08%)
- Algorithm (16.49%)
- Discrete mathematics (15.18%)
What were the highlights of his more recent work (between 2006-2021)?
- Theoretical computer science (24.08%)
- Joins (4.71%)
- Computation (4.45%)
In recent papers he was focusing on the following fields of study:
Theoretical computer science, Joins, Computation, Algorithm and Data mining are his primary areas of study.
Jeffrey D. Ullman combines subjects such as Chain, Approximation algorithm, Graph, Parallel algorithm and Upper and lower bounds with his study of Theoretical computer science.
His Joins research is multidisciplinary, incorporating perspectives in Hash function, Tuple, Adaptation and Parallel computing.
His study in Computation is interdisciplinary in nature, drawing from both Distributed computing and Mathematical optimization.
His Algorithm research is multidisciplinary, relying on both Join and Combinatorics.
His Data mining research incorporates themes from Distributed database, Set and Cluster analysis.
Between 2006 and 2021, his most popular works were:
- Mining of Massive Datasets (1521 citations)
- Introduction To Automata Theory, Languages And Computation, 3Rd Edition (848 citations)
- Optimizing joins in a map-reduce environment (308 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Algorithm
- Artificial intelligence
Jeffrey D. Ullman mainly investigates Theoretical computer science, Algorithm, Map reduce, Joins and Cluster analysis.
His Theoretical computer science study incorporates themes from Approximation algorithm, Similarity, Theory of computation, Graph and Parallel algorithm.
He interconnects Computability, DFA minimization and Automata theory in the investigation of issues within Theory of computation.
His research in Algorithm intersects with topics in Intersection, Logarithm, Join and Parallel processing.
His Map reduce research includes elements of Discrete mathematics, Matrix multiplication, Computation, Embarrassingly parallel and Partition.
His studies deal with areas such as Tuple, Fact table, Data mining and Fuzzy logic as well as Joins.
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.
