Computer Science

Computer Science Colloquium

Donald Knuth
Stanford University

Experiences with SAT

Tue 21.05.2013, 10:00, 60 minutes


On May 21st there will be a public appearance, open to everyone, consisting of two parts.
The first part is an informal talk about


Donald Knuth, a Professor Emeritus of the Art of Computer Programming at Stanford University, is one of the most influential pioneers in computer science. He was awarded many prizes, including the Turing Award, the highest distinction in the field, considered as the Nobel Prize of computer science.
His multivolume work The Art of Computer Programming, which is still work in progress, is regarded as one of the seminal and most comprehensive compendiums in the area of computer programming. The first volume appeared in 1968. As a researcher in computer science, he is regarded as the "father" of several subareas called the analysis of algorithms, LR(k) and LL(k) parsing, attribute grammars, empirical study of programming languages, and literate programming.
His best-known research in mathematics is represented by the Knuth-Bendix algorithm for word problems, the Robinson-Schensted-Knuth correspondence between matrices and tableaux, and an analysis of the big bang that occurs in the evolution of random graphs.
As a university professor he introduced a variety of new courses into the curriculum, notably Concrete Mathematics, and supervised 28 dissertations. And as a programmer, he wrote software systems called TeX and METAFONT that are used for the majority of today's mathematical publications and now have more than a million users worldwide.
He is said to still write several programs a week.
Invited by Univ.-Prof. Dr. Armin Biere

The Computer Science Colloquium is organized by the Department of Coputer Science at JKU, the Österreichische Gesellschaft für Informatik (ÖGI) and the Österreichische Computergesellschaft (OCG).
List of all talks
Last modified on Thursday, 01-Jan-1970 01:00:00 CET