The latest list of previous Tuling Awards 2004 Vinton G. Cerf, Robert E. Kahn Winners: Due to the work of the Internet, this includes designing and implementing the Internet's infrastructure protocol, TCP / IP, and in network Excellent leadership. 2003 Alan Kay Winning Cause: Due to the original idea of object-oriented language, SMALLTALK's development team and the basic contribution to PC are leading. The famous saying: The best way to predict the future is to create it. 2002 Ronald L. Rivest, Adi Shamir, Leonard M. ADLEMAN Winning Cause: Due to the basic work of public key theory and practices. 2001 OLE-JOHAN DAHL, KRISTEN NYGAARD Winning Cause: These concepts are concentrated in the programming language SIMULA I and SIMULA 67 that are designated by object-oriented programming. 2000 Andrew Chi-Chih Yao (Yao period Zhi) Winners: Due to the award, including pseudo-random numbers, encryption algorithm and communication complexity due to the contribution of calculation theory. 1999 Frederick P. Brooks, JR. Winning Cause: The contribution of milestonic meanings made in computer architecture, operating system, and software engineering. The author of the moon mythology. 1998 James Gray Winning Cause: Due to the technical leadership of database, transaction research and related system implementation. 1997 Douglas Engelbart Winners: Because of the exciting interactive computer future conception, and the implementation of key technologies invented. 1996 Amir PNueli Winners: Due to the introduction of Temport logic in computational science and outstanding contributions to programming and system certification. 1995 Manuel Blum Winning Cause: Due to calculating complexity theory, cryptography, and program verification fundamental contributions. 1994 Edward Feigenbaum, Raj Reddy Winning Cause: Due to the large-scale artificial intelligence system they designed and built, the importance of artificial intelligence technology and its potential business value are proved. 1993 JURIS HARTMANIS, RICHARD E. Stearns Winning Cause: Because their thesis laid the basis for calculating complexity theory. 1992 Butler W. Lampson Winning Cause: Due to personal distributed computer systems and its implementation technologies, this includes: workstation, network, operating system, programming system, display, security, and document release. 1991 Robin Milner Winning Cause: Due to the three aspects of functional logic (LCF), ML and parallelism (CCS), it is prominent and perfect. 1990 Fernando J. Corbato 'Winning Cause: The Development of Computer Systems Shared by Multi-Function, Large Scale, Time, and Resource Shared Because of the organization and leadership. 1989 William (Velvel) Kahan Winners: Due to the basic contribution of numerical analysis. 1988 Ivan Sutherland Winners: Due to the pioneering and visional contribution of computer graphics, the technique established is still valid for two or 30 years. 1987 John Cocke Winning Cause: Due to the important contribution of compiler design and theory, large-scale system architecture, and development RISC. 1986 John Hopcroft, Robert Tarjan Winners: Due to the basic achievements of algorithm and data structure design and analysis. 1985 Richard M. Karp Winning Cause: Continuous contributions due to the theory of algorithms, especially in NP-Completeness theory. 1984 Niklaus Wirth Winning Cause: Due to the development of a series of new computing languages in Euler, Algol-W, Modula, and Pascal.
