|
Name |
Ullman, Jeffrey D. |
Location
|
Stanford University |
Primary Field
|
Computer and Information Sciences |
Election Citation
|
Ullman has set new standards in computer science advances, including compilers, theory of computation, data structures, and databases. |
Research Interests
|
Currently retired, Jeffrey D. Ullman has worked on a number of the central theoretical issues in Computer Science. In the 1970's, he looked at algorithms for some of the most fundamental computing operations, such as sorting, and applied language theory to design of parsers for programming languages. His ideas formed the basis for the parser-generator YACC, which for many years was the tool of choice for building parsers for programming languages. In the 1980's he investigated the theory of relational databases. He pioneered the use of the Datalog form of logic, which has recently been used for a variety of purposes, including a commercial data-management system. In the 1990's he was involved in various database-related endeavors, including information integration. After retiring in 2002, he helped develop Gradiance, an on-line service for automating homework in a way that gets students to solve problems rather than guessing. He also developed a theory of algorithms for the modern "MapReduce" style of parallel programming. In addition, he has written widely used texts in automata theory, algorithms, compilers, database systems, and data science. |
|
|
|