| Year |
|
Winner |
Winner Work |
| 2013 |
|
Leslie Lamport |
For fundamental contributions to the theory and practice of distributed and concurrent systems, notably the invention of concepts such as causality and logical clocks, safety and liveness, replicated state machines, and sequential consistency. |
| 2012 |
|
Silvio Micali |
For transformative work that laid the complexity-theoretic foundations for the science of cryptography and in the process pioneered new methods for efficient verification of mathematical proofs in complexity theory. |
|
Shafi Goldwasser |
For transformative work that laid the complexity-theoretic foundations for the science of cryptography and in the process pioneered new methods for efficient verification of mathematical proofs in complexity theory. |
| 2011 |
|
Judea Pearl |
For fundamental contributions to artificial intelligence through the development of a calculus for probabilistic and causal reasoning |
| 2010 |
|
Leslie Valiant |
For transformative contributions to the theory of computation, including the theory of probably approximately correct (PAC) learning, the complexity of enumeration and of algebraic computation, and the theory of parallel and distributed computing. |
| 2009 |
|
Charles P. Thacker |
For his pioneering design and realization of the Xerox Alto, the first modern personal computer, and in addition for his contributions to the Ethernet and the Tablet PC. |
| 2008 |
|
Barbara Liskov |
For contributions to practical and theoretical foundations of programming language and system design, especially related to data abstraction, fault tolerance, and distributed computing. |
| 2007 |
|
E. Allen Emerson |
For [their roles] in developing Model-Checking into a highly effective verification technology, widely adopted in the hardware and software industries |
|
Joseph Sifakis |
For [their roles] in developing Model-Checking into a highly effective verification technology, widely adopted in the hardware and software industries |
|
Edmund M. Clarke |
For [their roles] in developing Model-Checking into a highly effective verification technology, widely adopted in the hardware and software industries |
| 2006 |
|
Frances Allen |
For pioneering contributions to the theory and practice of optimizing compiler techniques that laid the foundation for modern optimizing compilers and automatic parallel execution. |
| 2005 |
|
Peter Naur |
For fundamental contributions to programming language design and the definition of ALGOL 60, to compiler design, and to the art and practice of computer programming. |
| 2004 |
|
Vint Cerf |
For pioneering work on internetworking, including the design and implementation of the Internet's basic communications protocols, TCP/IP, and for inspired leadership in networking. |
|
Robert E. Kahn |
For pioneering work on internetworking, including the design and implementation of the Internet's basic communications protocols, TCP/IP, and for inspired leadership in networking. |
| 2003 |
|
Alan Kay |
For pioneering many of the ideas at the root of contemporary object-oriented programming languages, leading the team that developed Smalltalk, and for fundamental contributions to personal computing. |
| 2002 |
|
Leonard Adleman |
For their ingenious contribution for making public-key cryptography useful in practice. |
|
Adi Shamir |
For their ingenious contribution for making public-key cryptography useful in practice. |
|
Ronald Rivest |
For their ingenious contribution for making public-key cryptography useful in practice. |
| 2001 |
|
Kristen Nygaard |
For ideas fundamental to the emergence of object-oriented programming, through their design of the programming languages Simula I and Simula 67. |
|
Ole-Johan Dahl |
For ideas fundamental to the emergence of object-oriented programming, through their design of the programming languages Simula I and Simula 67. |
| 2000 |
|
Andrew Yao |
In recognition of his fundamental contributions to the theory of computation, including the complexity-based theory of pseudorandom number generation, cryptography, and communication complexity. |
| 1999 |
|
Fred Brooks |
For landmark contributions to computer architecture, operating systems, and software engineering. |
| 1998 |
|
Jim Gray |
for seminal contributions to database and transaction processing research and technical leadership in system implementation |
| 1997 |
|
Douglas Engelbart |
For an inspiring vision of the future of interactive computing and the invention of key technologies to help realize this vision. |
| 1996 |
|
Amir Pnueli |
for seminal work introducing temporal logic into computing science and for outstanding contributions to program and systems verification. |
| 1995 |
|
Manuel Blum |
In recognition of his contributions to the foundations of computational complexity theory and its application to cryptography and program checking. |
| 1994 |
|
Edward Feigenbaum |
For pioneering the design and construction of large scale artificial intelligence systems, demonstrating the practical importance and potential commercial impact of artificial intelligence technology. |
|
Raj Reddy |
For pioneering the design and construction of large scale artificial intelligence systems, demonstrating the practical importance and potential commercial impact of artificial intelligence technology. |
| 1993 |
|
Richard Stearns |
In recognition of their seminal paper which established the foundations for the field of computational complexity theory. |
|
Juris Hartmanis |
In recognition of their seminal paper which established the foundations for the field of computational complexity theory. |
| 1992 |
|
Butler Lampson |
For contributions to the development of distributed, personal computing environments and the technology for their implementation: workstations, networks, operating systems, programming systems, displays, security and document publishing. |
| 1991 |
|
Robin Milner |
For three distinct and complete achievements: 1) LCF, the mechanization of Scott's Logic of Computable Functions, probably the first theoretically based yet practical tool for machine assisted proof construction; 2) ML, the first language to include polymorphic type inference together with a type-safe exception-handling mechanism; 3) CCS, a general theory of concurrency. In addition, he formulated and strongly advanced full abstraction, the study of the relationship between operational and denotational semantics. |
| 1990 |
|
Fernando J. Corbató |
for his pioneering work in organizing the concepts and leading the development of the general-purpose, large-scale, time-sharing and resource-sharing computer systems. |
| 1989 |
|
William Kahan |
For his fundamental contributions to numerical analysis. One of the foremost experts on floating-point computations. Kahan has dedicated himself to making the world safe for numerical computations. |
| 1988 |
|
Ivan Sutherland |
For his pioneering and visionary contributions to computer graphics, starting with Sketchpad, and continuing after |
| 1987 |
|
John Cocke |
For significant contributions in the design and theory of compilers, the architecture of large systems and the development of reduced instruction set computers (RISC) |
| 1986 |
|
Robert Tarjan |
For fundamental achievements in the design and analysis of algorithms and data structures. |
|
John Hopcroft |
For fundamental achievements in the design and analysis of algorithms and data structures. |
| 1985 |
|
Richard M. Karp |
For his continuing contributions to the theory of algorithms including the development of efficient algorithms for network flow and other combinatorial optimization problems, the identification of polynomial-time computability with the intuitive notion of algorithmic efficiency, and, most notably, contributions to the theory of NP-completeness |
| 1984 |
|
Niklaus Wirth |
For developing a sequence of innovative computer languages, EULER, ALGOL-W, MODULA and PASCAL |
| 1983 |
|
Ken Thompson |
For their development of generic operating systems theory and specifically for the implementation of the UNIX operating system |
|
Dennis Ritchie |
For their development of generic operating systems theory and specifically for the implementation of the UNIX operating system |
| 1982 |
|
Stephen Cook |
For his advancement of our understanding of the complexity of computation in a significant and profound way. His seminal paper, The Complexity of Theorem Proving Procedures, presented at the 1971 ACM SIGACT Symposium on the Theory of Computing, laid the foundations for the theory of NP-Completeness. The ensuing exploration of the boundaries and nature of NP-complete class of problems has been one of the most active and important research activities in computer science for the last decade. |
| 1981 |
|
Edgar F. Codd |
For his fundamental and continuing contributions to the theory and practice of database management systems, esp. relational databases |
| 1980 |
|
Tony Hoare |
For his fundamental contributions to the definition and design of programming languages |
| 1979 |
|
Kenneth E. Iverson |
For his pioneering effort in programming languages and mathematical notation resulting in what the computing field now knows as APL, for his contributions to the implementation of interactive systems, to educational uses of APL, and to programming language theory and practice |
| 1978 |
|
Robert W. Floyd |
For having a clear influence on methodologies for the creation of efficient and reliable software, and for helping to found the following important subfields of computer science: the theory of parsing, the semantics of programming languages, automatic program verification, automatic program synthesis, and analysis of algorithms |
| 1977 |
|
John Backus |
For profound, influential, and lasting contributions to the design of practical high-level programming systems, notably through his work on FORTRAN, and for seminal publication of formal procedures for the specification of programming languages |
| 1976 |
|
Michael O. Rabin |
For their joint paper Finite Automata and Their Decision Problem, which introduced the idea of nondeterministic machines, which has proved to be an enormously valuable concept. Their (Scott & Rabin) classic paper has been a continuous source of inspiration for subsequent work in this field |
|
Dana Scott |
For their joint paper Finite Automata and Their Decision Problem, which introduced the idea of nondeterministic machines, which has proved to be an enormously valuable concept. Their (Scott & Rabin) classic paper has been a continuous source of inspiration for subsequent work in this field |
| 1975 |
|
Allen Newell |
for their basic contributions to artificial intelligence and the psychology of human cognition |
|
Herbert Simon |
for their basic contributions to artificial intelligence and the psychology of human cognition |
| 1974 |
|
Donald Knuth |
For his major contributions to the analysis of algorithms and the design of programming languages, and in particular for his contributions to The Art of Computer Programming through his well-known books in a continuous series by this title |
| 1973 |
|
Charles Bachman |
For his outstanding contributions to database technology |
| 1972 |
|
Edsger W. Dijkstra |
for fundamental contributions in the area of programming languages |
| 1971 |
|
John McCarthy |
for his major contributions to the field of Artificial Intelligence |
| 1970 |
|
James H. Wilkinson |
For his research in numerical analysis to facilitate the use of the high-speed digital computer, having received special recognition for his work in computations in linear algebra and backward error analysis |
| 1969 |
|
Marvin Minsky |
for his work in artificial intelligence |
| 1968 |
|
Richard Hamming |
For his work on numerical methods, automatic coding systems, and error-detecting and error-correcting codes |
| 1967 |
|
Maurice Vincent Wilkes |
Builder and designer of the EDSAC, the first computer with an internally stored program. |
| 1966 |
|
Alan Perlis |
For his influence in the area of advanced programming techniques and compiler construction |
