• go to Manuel Blum's profile page
  • go to A. J. Perlis 's profile page
  • go to Marvin Minsky 's profile page
  • go to Joseph Sifakis's profile page
  • go to Donald E. Knuth's profile page
  • go to Peter Naur's profile page
  • go to Charles W Bachman's profile page
  • go to Richard Karp's profile page
  • go to Pat Hanrahan's profile page
  • go to John E Hopcroft's profile page
  • go to Dana S Scott's profile page
  • go to Vinton Cerf's profile page
  • go to Robert W. Floyd's profile page
  • go to William Kahan's profile page
  • go to Ronald L Rivest's profile page
  • go to Judea Pearl's profile page
  • go to Juris Hartmanis's profile page
  • go to Leslie Lamport's profile page
  • go to Edgar F. Codd's profile page
  • go to Ole-Johan Dahl 's profile page
  • go to Kenneth Lane Thompson's profile page
  • go to Geoffrey E Hinton's profile page
  • go to Adi Shamir's profile page
  • go to John Cocke 's profile page
A.M. TURING AWARD WINNERS BY...

Jeffrey David Ullman DL Author Profile link

United States – 2020
Short Annotated Bibliography
  • J.E. Hopcroft and J.D. Ullman. Formal Languages and their Relation to Automata. Reading, MA: Addison-Wesley, 1969.

Ullman’s first book, coauthored with John Hopcroft and based on a course developed by Hopcroft at Princeton in the mid-1960s. As a discipline, computer science was built upon a body of theory and techniques drawn from existing subfields within mathematics, engineering, and logic. Books like this were vital in integrating these formerly scattered areas of knowledge, extending them in ways relevant to the study of computation, and presenting them in a coherent way to the first generation of students educated as computer scientists.

  • A.V. Aho, J.E. Hopcroft and J.D. Ullman. The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974.

This book is considered a classic in the field and was one of the most cited books in computer science research for more than a decade. It became the standard textbook for algorithms courses throughout the world when computer science was still an emerging field. In addition to incorporating their own research contributions to algorithms, The Design and Analysis of Computer Algorithms introduced the random access machine (RAM) as the basic model for analyzing the time and space complexity of computer algorithms using recurrence relations. The RAM model also codified disparate individual algorithms into general design methods. It, and the general algorithm design techniques introduced in this book, are now integral parts of the standard computer science curriculum.

  • A.V. Aho & J.D. Ullman. Principles of Compiler Design. Reading, MA: Addison Wesley, 1977.

Integrated formal language theory and syntax-directed translation techniques into the compiler design process. Often called the “Dragon Book” because of its cover design, it lucidly lays out the phases in translating a high-level programming language to machine code, modularizing the entire enterprise of compiler construction. It includes algorithmic contributions that the authors made to efficient techniques for lexical analysis, syntax analysis techniques, and code generation. The current edition of this book, Compilers: Principles, Techniques and Tools (co-authored with Ravi Sethi and Monica Lam), was published in 2007 and remains the standard textbook on compiler design.

  • J.D. Ullman, Principles of Database Systems. New York: Computer Science Press, 1980.

This book, which has been revised several times, trained generations of computer scientists in data models, database design, and the use of database management systems. It revolutionized the content of database courses at all levels, moving database design from a purely engineering discipline to one with a firm theoretical foundation.

  • H. García-Molina, J.D. Ulmman and J. Widom. Database Systems: The Complete Book, Englewood Cliffs, NJ: Prentice-Hall, 2009.

Compiles material based on the courses taught by Ullman and his colleagues at the Stanford InfoLab.

  • A. Rajaraman, J.D. Ullman. Mining of Massive Datasets, Cambridge Univ. Press, 2012.

Explores the manipulation of web data and included discussion of cloud-based techniques for parallel programming. Based on courses taught at Stanford. The second (2014) and third (2020) editions include Jure Leskovec as an author. Available free for download from a link at http://www.mmds.org/.