2020 - Member of the National Academy of Sciences
2012 - Fellow of the American Academy of Arts and Sciences
2010 - IEEE John von Neumann Medal “For laying the foundations for the fields of automata and language theory and many seminal contributions to theoretical computer science.”
1997 - ACM Karl V. Karlstrom Outstanding Educator Award For his profound and lasting impact on computer science education through the books he has written, and the doctoral students he has supervised.
1995 - ACM Fellow For seminal contributions to the foundations of computer science, compiler design, database systems, as well as outstanding contributions to computer science education.
1989 - Member of the National Academy of Engineering For contributions to theoretical computer science and for writing outstanding textbooks.
1988 - Fellow of John Simon Guggenheim Memorial Foundation
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 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.
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.
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.
Introduction to Automata Theory, Languages, and Computation
John E. Hopcroft;Rajeev Motwani;Rotwani;Jeffrey D. Ullman.
Compilers: Principles, Techniques, and Tools
Alfred V. Aho;Ravi Sethi;Jeffrey D. Ullman.
Data structures and algorithms
Alfred V. Aho;John E. Hopcroft;Jeffrey Ullman.
Principles of database and knowledge-base systems
Jeffrey D. Ullman.
The Theory of Parsing, Translation, and Compiling
Alfred V. Aho;Jeffrey D. Ullman.
Principles of Database Systems
Jeffrey D. Ullman.
379 p. : ill. Potomac, Maryland: Computer Science Press, 1980. includes bibliography: p.360-371 and index. -- (Computer Software Engineering Series) (1983)
Dynamic itemset counting and implication rules for market basket data
Sergey Brin;Rajeev Motwani;Jeffrey D. Ullman;Shalom Tsur.
international conference on management of data (1997)
Formal Languages and Their Relation to Automata
John E. Hopcroft;Jeffrey D. Ullman.
Principles of database and knowledge-base systems, Vol. I
Jeffrey D. Ullman.
Database Systems: The Complete Book
Hector Garcia-Molina;Jeffrey D. Ullman;Jennifer Widom.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: