Jeffrey Ullman

Jeffrey David Ullman (born November 22, 1942)[2] is an American computer scientist and the Stanford W. Ascherman Professor of Engineering, Emeritus, at Stanford University. His textbooks on compilers (various editions are popularly known as the green dragon book), theory of computation (also known as the Cinderella book), data structures, and databases are regarded as standards in their fields. He and his long-time collaborator Alfred Aho are the recipients of the 2020 Turing Award, generally recognized as the highest distinction in computer science.[3]

Jeffrey Ullman
Born (1942-11-22) November 22, 1942 (age 79)
NationalityAmerican
CitizenshipAmerican
Alma materColumbia University
Princeton University
Known fordatabase theory, database systems, formal language theory
AwardsACM Fellow (1994)
Knuth Prize (2000)
IEEE John von Neumann Medal (2010)
Turing Award (2020)
Scientific career
InstitutionsStanford University
ThesisSynchronization Error Correcting Codes[1] (1966)
Doctoral advisorArthur Bernstein, Archie McKellar
Doctoral students

CareerEdit

Ullman received a Bachelor of Science degree in Engineering Mathematics from Columbia University in 1963 and his Ph.D. in Electrical Engineering from Princeton University in 1966. He then worked for three years at Bell Labs. In 1969, he returned to Princeton as an associate professor, and was promoted to full professor in 1974. Ullman moved to Stanford University in 1979, and served as the department chair from 1990 to 1994. He was named the Stanford W. Ascherman Professor of Computer Science in 1994,[4] and became an Emeritus in 2003.[5]

In 1994 Ullman was inducted as a Fellow of the Association for Computing Machinery; in 2000 he was awarded the Knuth Prize.[4] Ullman is the co-recipient (with John Hopcroft) of the 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."[6] Ullman, Hopcroft, and Alfred Aho were co-recipients of the 2017 C&C Prize awarded by NEC Corporation.[7]

Ullman's research interests include database theory, data integration, data mining, and education using online infrastructure. He is one of the founders of the field of database theory: many of his Ph.D. students became influential in the field as well. He was the Ph.D. advisor of Sergey Brin, one of the co-founders of Google, and served on Google's technical advisory board.[8][9] He is a founder of Gradiance Corporation, which provides homework grading support for college courses.[4] He teaches courses on automata and mining massive datasets on the Stanford Online learning platform.[10][11]

Ullman was elected as a member of the National Academy of Sciences in 2020.[12] He also sits on the advisory board of TheOpenCode Foundation.[13] On March 31, 2021, he and Aho were named recipients of 2020 Turing Award.[14]

ControversiesEdit

In 2011, Ullman stated his opposition to assisting Iranians in becoming graduate students at Stanford, because of the anti-Israel position of the Iranian government. In response to a call by the National Iranian American Council for disciplinary action against Ullman for what they described as his "racially discriminatory and inflammatory" comments, a Stanford spokesperson stated that Ullman was expressing his own personal views and not the views of the university, and that he was uninvolved in admissions.[15]

In April 2021, an open letter[16] by CSForInclusion criticized ACM and ACM A.M. Turing Award Committee for nominating and selecting Ullman as recipient of the ACM A.M. Turing award. ACM reconfirmed its commitments to inclusion and diversity in a response[17] to the letter.

BooksEdit

  • Mining of massive datasets (with Jure Leskovec and Anand Rajaraman), Prentice-Hall, Second edition 2014. ISBN 978-1-1070-7723-2[18]
  • Database Systems: The Complete Book (with H. Garcia-Molina and J. Widom), Prentice-Hall, Englewood Cliffs, NJ, 2002. ISBN 978-0-1303-1995-1[19]
  • Introduction to Automata Theory, Languages, and Computation, (with J. E. Hopcroft and R. Motwani), Addison-Wesley, Reading MA, 1969, 1979 (ISBN 978-0-2010-2988-8),[20] 2000.
  • Elements of ML Programming, Prentice-Hall, Englewood Cliffs, NJ, 1993, 1998. ISBN 978-0-13-790387-0
  • A First Course in Database Systems (with J. Widom), Prentice-Hall, Englewood Cliffs, NJ, 1997, 2002.ISBN 978-0-13-861337-2
  • Foundations of Computer Science (with A. V. Aho), Computer Science Press, New York, 1992 (ISBN 978-0-7167-8233-9).[21] C edition, 1995 (ISBN 978-0-7167-8284-1).[22]
  • Principles of Database and Knowledge-Base Systems (two volumes), Computer Science Press, New York, 1988, 1989.
  • Compilers: Principles, Techniques, and Tools (with A. V. Aho and R. Sethi), Addison-Wesley, Reading MA, 1977, 1986.
  • Computational Aspects of VLSI, Computer Science Press, 1984 ISBN 978-0-914894-95-7
  • Data Structures and Algorithms (with A. V. Aho and J. E. Hopcroft), Addison-Wesley, Reading MA, 1983. ISBN 978-0-2010-0023-8[23]
  • Principles of Compiler Design (with A. V. Aho), Addison-Wesley, Reading, MA, 1977.
  • Fundamental Concepts of Programming Systems, Addison-Wesley, Reading MA, 1976. ISBN 0-201-07654-3
  • The Design and Analysis of Computer Algorithms (with A. V. Aho and J. E. Hopcroft), Addison-Wesley, Reading MA, 1974. ISBN 978-0-2010-0029-0[24]
  • Formal Languages and Their Relation to Automata (with J. E. Hopcroft), Addison-Wesley, Reading MA, 1969. ISBN 978-0-2010-2983-3[25]

ReferencesEdit

  1. ^ Jeffrey Ullman at the Mathematics Genealogy Project
  2. ^ Ullman, Jeffrey D. "Vita". Stanford University. Retrieved April 2, 2021.
  3. ^ ACM Turing Award Honors Innovators Who Shaped the Foundations of Programming Language Compilers and Algorithms. Retrieved March 31, 2021.
  4. ^ a b c "Prof. Jeffrey Ullman, Stanford University". ODBMS.org. Retrieved April 3, 2021.
  5. ^ Ullman, Jeffrey D. "Advising Students For Success | March 2009 | Communications of the ACM". cacm.acm.org. Retrieved April 3, 2021.
  6. ^ "IEEE John von Neumann Medal Recipients". IEEE. Archived from the original on November 24, 2010.
  7. ^ "2017 C&C Prize Ceremony". NEC C&C Foundation. Retrieved April 3, 2021.
  8. ^ Kahn, Jeremy (March 31, 2021). "Programming language pioneers win this year's Turing Award". Fortune. Retrieved April 3, 2021.
  9. ^ "Distinguished Lecturer Series" (PDF). Ben Gurion University of the Negev. 2009.
  10. ^ "Stanford - Automata". Stanford Online.
  11. ^ "Stanford - Mining Massive Datasets". Stanford Online.
  12. ^ "16 faculty members, 18 alumni elected to nation's historic academies". The Princetonian. Retrieved May 11, 2020.
  13. ^ "TheOpenCode Foundation Team Page". TheOpenCode Foundation. Retrieved December 15, 2020.
  14. ^ ACM Turing Award Honors Innovators Who Shaped the Foundations of Programming Language Compilers and Algorithms. Retrieved March 31, 2021.
  15. ^ Keller, Josh (January 5, 2011). "Iranian-American Group Calls on Stanford to Censure Professor". The Chronicle of Higher Education.
  16. ^ "CSForInclusion Letter" (PDF). Association for Computing Machinery.
  17. ^ "ACM Response to the Selection of Jeffrey Ullman for a Turing Award". Association for Computing Machinery.
  18. ^ "Mining of massive datasets". worldcat.org. Retrieved April 3, 2021.
  19. ^ Database systems : the complete book. worldcat.org. OCLC 47915796. Retrieved April 1, 2021.
  20. ^ "Introduction to automata theory, languages, and computation". worldcat.org. Retrieved April 2, 2021.
  21. ^ Foundations of computer science. worldcat.org. OCLC 24669768. Retrieved April 1, 2021.
  22. ^ "Foundations of computer science : C Edition". worldcat.org. Retrieved April 1, 2021.
  23. ^ Data structures and algorithms. worldcat.org. OCLC 8626442. Retrieved April 1, 2021.
  24. ^ The design and analysis of computer algorithms. worldcat.org. OCLC 1147299. Retrieved April 1, 2021.
  25. ^ Formal languages and their relation to automata. worldcat.org. OCLC 5012. Retrieved April 1, 2021.

External linksEdit