Jeffrey Ullman

Jeffrey D. Ullman
Born (1942-11-22) November 22, 1942
Citizenship American
Nationality American
Institutions Stanford University
Alma mater Columbia University
Princeton University
Thesis Synchronization Error Correcting Codes[1] (1966)
Doctoral advisor Arthur Bernstein, Archie McKellar
Doctoral students Himanshu Gupta
Surajit Chaudhuri
Kevin Karplus
David Maier
Harry Mairson
Alberto O. Mendelzon
Jeffrey F. Naughton
Anand Rajaraman
Yehoshua Sagiv
Mihalis Yannakakis
Alan J. Demers
Known for database theory, database systems, formal language theory
Notable awards Fellow of the Association for Computing Machinery (1994)
ACM SIGMOD Contributions Award (1996)
ACM SIGMOD Best Paper Award (1996)
Karl V. Karlstrom outstanding educator award (1998)
Knuth Prize (2000)
ACM SIGMOD Edgar F. Codd Innovations Award (2006)
ACM SIGMOD Test of Time Award (2006)
IEEE John von Neumann Medal (2010)

Jeffrey David "Jeff" Ullman (born November 22, 1942) is a computer scientist and professor at Stanford University. His textbooks on compilers (various editions are popularly known as the Dragon Book), theory of computation (also known as the Cinderella book), data structures, and databases are regarded as standards in their fields.

Early life and career

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 several years at Bell Labs. From 1969 to 1979 he was a professor at Princeton. Since 1979 he has been a professor at Stanford University, where he is currently the Stanford W. Ascherman Professor of Computer Science (Emeritus). In 1995 he was inducted as a Fellow of the Association for Computing Machinery and in 2000 he was awarded the Knuth Prize. Ullman is also 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.”[2]

Ullman's research interests include database theory, data integration, data mining, and education using the information infrastructure. He is one of the founders of the field of database theory, and was the doctoral advisor of an entire generation of students who later became leading database theorists in their own right. He was the Ph.D. advisor of Sergey Brin, one of the co-founders of Google, and served on Google's technical advisory board. He is currently the CEO of Gradiance. He teaches a course on Automata and Mining Massive Datasets on the online learning platform Coursera.[3][4]

Controversies

Ullman claims in his personal page at Stanford to be against the Iranian government,[5] but it's also alleged that he has demonstrated anti-Iranian sentiments. In one case, he responded to an email from an Iranian student who had inquired about admission at Stanford with an off-topic political rant and went on to say that he would not help Iranian students even if he could:

And even if I were in a position to help, I will not help Iranian students until Iran recognizes and respects Israel as the land of the Jewish people. I know that you may not hold the same insane position as the mullahs that run your country, but it is a matter of principle. If Iranians want the benefits of Stanford and other institutions in the US, they have to respect the values we hold in the US, including freedom of religion and respect for human rights.

Following that the National Iranian American Council issued a formal complaint to Stanford University,[6] to which Stanford spokesperson, Lisa Lapin responded that Ullman was expressing his own personal views and not the views of the University and that "he has no involvement in admission, and Stanford doesn’t discriminate in their admission process"[7][8][9][10]

Books

References

External links

This article is issued from Wikipedia - version of the 8/26/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.