ACM Turing Award | |
---|---|

Awarded for | Outstanding contributions in computer science |

Country | United States |

Presented by | Association for Computing Machinery (ACM) |

Reward(s) | US $1,000,000^{ [1] } |

First awarded | 1966 |

Last awarded | 2019 |

Website | amturing |

The **ACM A.M. Turing Award** is an annual prize given by the Association for Computing Machinery (ACM) to an individual selected for contributions "of lasting and major technical importance to the computer field".^{ [2] } The Turing Award is generally recognized as the highest distinction in computer science.^{ [3] }^{ [4] }^{ [5] }^{ [6] }

The award is named after Alan Turing, who was a British mathematician and reader in mathematics at the University of Manchester. Turing is often credited as being the key founder of theoretical computer science and artificial intelligence.^{ [7] } From 2007 to 2013, the award was accompanied by an additional prize of US$250,000, with financial support provided by Intel and Google.^{ [2] } Since 2014, the award has been accompanied by a prize of US$1 million, with financial support provided by Google.^{ [1] }^{ [8] }

The first recipient, in 1966, was Alan Perlis, of Carnegie Mellon University. The first female recipient was Frances E. Allen of IBM in 2006.^{ [9] }

Year | Recipient | Photo | Rationale |
---|---|---|---|

1966 | Alan Perlis | For his influence in the area of advanced computer programming techniques and compiler construction.^{ [10] } | |

1967 | Maurice Wilkes | Wilkes is best known as the builder and designer of the EDSAC, the first computer with an internally stored program. Built in 1949, the EDSAC used a mercury delay line memory. He is also known as the author, with Wheeler and Gill, of a volume on "Preparation of Programs for Electronic Digital Computers" in 1951, in which program libraries were effectively introduced.^{ [11] } | |

1968 | Richard Hamming | For his work on numerical methods, automatic coding systems, and error-detecting and error-correcting codes.^{ [12] } | |

1969 | Marvin Minsky | For his central role in creating, shaping, promoting, and advancing the field of artificial intelligence.^{ [13] } | |

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.^{ [14] } | |

1971 | John McCarthy | McCarthy's lecture "The Present State of Research on Artificial Intelligence" is a topic that covers the area in which he has achieved considerable recognition for his work.^{ [15] } | |

1972 | Edsger W. Dijkstra | Edsger Dijkstra was a principal contributor in the late 1950s to the development of the ALGOL, a high level programming language which has become a model of clarity and mathematical rigor. He is one of the principal proponents of the science and art of programming languages in general, and has greatly contributed to our understanding of their structure, representation, and implementation. His fifteen years of publications extend from theoretical articles on graph theory to basic manuals, expository texts, and philosophical contemplations in the field of programming languages.^{ [16] } | |

1973 | Charles Bachman | For his outstanding contributions to database technology.^{ [17] } | |

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.^{ [18] } | |

1975 | Allen Newell | In joint scientific efforts extending over twenty years, initially in collaboration with J. C. Shaw at the RAND Corporation, and subsequently with numerous faculty and student colleagues at Carnegie Mellon University, they have made basic contributions to artificial intelligence, the psychology of human cognition, and list processing.^{ [19] } | |

Herbert A. Simon | |||

1976 | Michael O. Rabin | For their joint paper "Finite Automata and Their Decision Problem,"^{ [20] } 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.^{ [21] }^{ [22] } | |

Dana Scott | |||

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.^{ [23] } | |

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.^{ [24] } | |

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.^{ [25] } | |

1980 | Tony Hoare | For his fundamental contributions to the definition and design of programming languages.^{ [26] } | |

1981 | Edgar F. Codd | For his fundamental and continuing contributions to the theory and practice of database management systems, esp. relational databases.^{ [27] } | |

1982 | Stephen A. Cook | For his advancement of our understanding of the complexity of computation in a significant and profound way.^{ [28] } | |

1983 | Ken Thompson | For their development of generic operating systems theory and specifically for the implementation of the UNIX operating system.^{ [29] }^{ [30] } | |

Dennis M. Ritchie | |||

1984 | Niklaus Wirth | For developing a sequence of innovative computer languages, EULER, ALGOL-W, MODULA and Pascal. | |

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. | |

1986 | John Hopcroft | For fundamental achievements in the design and analysis of algorithms and data structures. | |

Robert Tarjan | |||

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). | |

1988 | Ivan Sutherland | For his pioneering and visionary contributions to computer graphics, starting with Sketchpad, and continuing after. | |

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." | |

1990 | Fernando J. Corbató | For his pioneering work organizing the concepts and leading the development of the general-purpose, large-scale, time-sharing and resource-sharing computer systems, CTSS and Multics. | |

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.^{ [31] } | |

1992 | Butler W. 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. | |

1993 | Juris Hartmanis | In recognition of their seminal paper which established the foundations for the field of computational complexity theory.^{ [32] } | |

Richard E. Stearns | |||

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.^{ [33] } | |

Raj Reddy | |||

1995 | Manuel Blum | In recognition of his contributions to the foundations of computational complexity theory and its application to cryptography and program checking.^{ [34] } | |

1996 | Amir Pnueli | For seminal work introducing temporal logic into computing science and for outstanding contributions to program and systems verification.^{ [35] } | |

1997 | Douglas Engelbart | For an inspiring vision of the future of interactive computing and the invention of key technologies to help realize this vision.^{ [36] } | |

1998 | Jim Gray | For seminal contributions to database and transaction processing research and technical leadership in system implementation. | |

1999 | Frederick P. Brooks | For landmark contributions to computer architecture, operating systems, and software engineering. | |

2000 | Andrew Chi-Chih 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. | |

2001 | 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. | |

Kristen Nygaard | |||

2002 | Ron Rivest | For their ingenious contribution for making public-key cryptography useful in practice. | |

Adi Shamir | |||

Leonard M. Adleman | |||

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. | |

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. | |

Bob Kahn | |||

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. | |

2006 | Frances E. 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. | |

2007 | Edmund M. Clarke | For their roles in developing model checking into a highly effective verification technology, widely adopted in the hardware and software industries.^{ [37] } | |

E. Allen Emerson | |||

Joseph Sifakis | |||

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. | |

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. | |

2010 | Leslie G. 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. | |

2011 | Judea Pearl ^{ [38] } | For fundamental contributions to artificial intelligence through the development of a calculus for probabilistic and causal reasoning.^{ [39] } | |

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.^{ [40] } | |

Shafi Goldwasser | |||

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.^{ [41] }^{ [42] } | |

2014 | Michael Stonebraker | For fundamental contributions to the concepts and practices underlying modern database systems.^{ [43] } | |

2015 | Martin E. Hellman | For fundamental contributions to modern cryptography. Diffie and Hellman's groundbreaking 1976 paper, "New Directions in Cryptography,"^{ [44] } introduced the ideas of public-key cryptography and digital signatures, which are the foundation for most regularly-used security protocols on the Internet today.^{ [45] } | |

Whitfield Diffie | |||

2016 | Tim Berners-Lee | For inventing the World Wide Web, the first web browser, and the fundamental protocols and algorithms allowing the Web to scale.^{ [46] } | |

2017 | John L. Hennessy | For pioneering a systematic, quantitative approach to the design and evaluation of computer architectures with enduring impact on the microprocessor industry.^{ [47] } | |

David Patterson | |||

2018 | Yoshua Bengio | For conceptual and engineering breakthroughs that have made deep neural networks a critical component of computing.^{ [48] } | |

Geoffrey Hinton | |||

Yann LeCun | |||

2019 | Ed Catmull | For fundamental contributions to 3-D computer graphics, and the revolutionary impact of these techniques on computer-generated imagery (CGI) in filmmaking and other applications.^{ [49] } | |

Pat Hanrahan |

**Nokia Bell Labs** is an industrial research and scientific development company owned by Finnish company Nokia. With headquarters located in Murray Hill, New Jersey, the company operates several laboratories in the United States and around the world. Bell Labs has its origins in the complex past of the Bell System.

**Edsger Wybe Dijkstra** was a Dutch systems scientist, programmer, software engineer, science essayist, and pioneer in computing science. A theoretical physicist by training, he worked as a programmer at the Mathematisch Centrum (Amsterdam) from 1952 to 1962. A university professor for much of his life, Dijkstra held the Schlumberger Centennial Chair in Computer Sciences at the University of Texas at Austin from 1984 until his retirement in 1999. He was a professor of mathematics at the Eindhoven University of Technology (1962–1984) and a research fellow at the Burroughs Corporation (1973–1984).

**Sir Charles Antony Richard Hoare** is a British computer scientist. He developed the sorting algorithm quicksort in 1959–1960. He also developed Hoare logic for verifying program correctness, and the formal language communicating sequential processes (CSP) to specify the interactions of concurrent processes and the inspiration for the programming language occam.

**Peter Naur** was a Danish computer science pioneer and Turing award winner. His last name is the "N" in the BNF notation, used in the description of the syntax for most programming languages. He contributed to the creation of the ALGOL 60 programming language.

**John Warner Backus** was an American computer scientist. He directed the team that invented and implemented FORTRAN, the first widely used high-level programming language, and was the inventor of the Backus–Naur form (BNF), a widely used notation to define formal language syntax. He later did research into the function-level programming paradigm, presenting his findings in his influential 1977 Turing Award lecture "Can Programming Be Liberated from the von Neumann Style?"

**Leslie B. Lamport** is an American computer scientist. Lamport is best known for his seminal work in distributed systems, and as the initial developer of the document preparation system LaTeX and the author of its first manual. Leslie Lamport was the winner of the 2013 Turing Award for imposing clear, well-defined coherence on the seemingly chaotic behavior of distributed computing systems, in which several autonomous computers communicate with each other by passing messages. He devised important algorithms and developed formal modeling and verification protocols that improve the quality of real distributed systems. These contributions have resulted in improved correctness, performance, and reliability of computer systems.

**Leonard Adleman** is an American computer scientist. He is one of the creators of the RSA encryption algorithm, for which he received the 2002 Turing Award, often called the Nobel prize of Computer science. He is also known for the creation of the field of DNA computing.

**Michael Oser Rabin** is an Israeli mathematician and computer scientist and a recipient of the Turing Award.

**Alan Jay Perlis** was an American computer scientist and professor at Purdue University, Carnegie Mellon University and Yale University. He is best known for his pioneering work in programming languages and was the first recipient of the Turing Award.

**Richard Edwin Stearns** is a prominent computer scientist who, with Juris Hartmanis, received the 1993 ACM Turing Award "in recognition of their seminal paper which established the foundations for the field of computational complexity theory". In 1994 he was inducted as a Fellow of the Association for Computing Machinery.

The **Gödel Prize** is an annual prize for outstanding papers in the area of theoretical computer science, given jointly by European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery Special Interest Group on Algorithms and Computational Theory. The award is named in honor of Kurt Gödel. Gödel's connection to theoretical computer science is that he was the first to mention the "P versus NP" question, in a 1956 letter to John von Neumann in which Gödel asked whether a certain NP-complete problem could be solved in quadratic or linear time.

**Shafrira "Shafi" Goldwasser** is an American-Israeli computer scientist and winner of the Turing Award in 2012. She is the RSA Professor of Electrical Engineering and Computer Science at MIT, a professor of mathematical sciences at the Weizmann Institute of Science, Israel, co-founder and chief scientist of Duality Technologies and the director of the Simons Institute for the Theory of Computing in Berkeley, CA.

**Silvio Micali** is an Italian computer scientist at MIT Computer Science and Artificial Intelligence Laboratory and a professor of computer science in MIT's Department of Electrical Engineering and Computer Science since 1983. His research centers on the theory of cryptography and information security.

**Barbara Liskov** is an American computer scientist who is an Institute Professor at the Massachusetts Institute of Technology and Ford Professor of Engineering in its School of Engineering's electrical engineering and computer science department. She was one of the first women to be granted a doctorate in computer science in the United States and is a Turing Award winner who developed the Liskov substitution principle.

**Leslie Gabriel Valiant** is a British computer scientist and computational theorist. He is currently the T. Jefferson Coolidge Professor of Computer Science and Applied Mathematics at Harvard University.

**Patrick M. Hanrahan** is an American computer graphics researcher, the Canon USA Professor of Computer Science and Electrical Engineering in the Computer Graphics Laboratory at Stanford University. His research focuses on rendering algorithms, graphics processing units, as well as scientific illustration and visualization. He has received numerous awards, including the 2019 Turing Award.

**Frances Elizabeth "Fran" Allen** is an American computer scientist and pioneer in the field of optimizing compilers. Allen was the first female IBM Fellow and in 2006 became the first woman to win the Turing Award. Her achievements include seminal work in compilers, program optimization, and parallelization. Since 2002, she has been a Fellow Emerita from IBM.

**Larry Joseph Stockmeyer** was an American computer scientist. He was one of the pioneers in the field of computational complexity theory, and he also worked in the field of distributed computing. He died of pancreatic cancer.

The **Annual ACM Symposium on Theory of Computing** (**STOC**) is an academic conference in the field of theoretical computer science. STOC has been organized annually since 1969, typically in May or June; the conference is sponsored by the Association for Computing Machinery special interest group SIGACT. Acceptance rate of STOC, averaged from 1970 to 2012, is 31%, with the rate of 29% in 2012.

- 1 2 Cacm Staff (2014). "ACM's Turing Award prize raised to $1 million".
*Communications of the ACM*.**57**(12): 20. doi:10.1145/2685372. - 1 2 "A. M. Turing Award". ACM. Archived from the original on 2009-12-12. Retrieved 2007-11-05.
- ↑ Dasgupta, Sanjoy; Papadimitriou, Christos; Vazirani, Umesh (2008).
*Algorithms*. McGraw-Hill. p. 317. ISBN 978-0-07-352340-8. - ↑ Bibliography of Turing Award lectures, DBLP
- ↑ Geringer, Steven (27 July 2007). "ACM'S Turing Award Prize Raised To $250,000". ACM press release. Archived from the original on 30 December 2008. Retrieved 2008-10-16.
- ↑ See also: Brown, Bob (June 6, 2011). "Why there's no Nobel Prize in Computing".
*Network World*. Retrieved June 3, 2015. - ↑ Homer, Steven and Alan L. (2001).
*Computability and Complexity Theory*. p. 35. ISBN 978-0-387-95055-6 . Retrieved 2007-11-05. - ↑ "ACM's Turing Award Prize Raised to $1 Million". ACM. Archived from the original on 2015-11-23. Retrieved 2014-11-13.
- ↑ "First Woman to Receive ACM Turing Award" (Press release). The Association for Computing Machinery. February 21, 2007. Archived from the original on July 2, 2007. Retrieved 2007-11-05.
- ↑ Perlis, A. J. (1967). "The Synthesis of Algorithmic Systems".
*Journal of the ACM*.**14**: 1–9. doi:10.1145/321371.321372. - ↑ Wilkes, M. V. (1968). "Computers then and Now".
*Journal of the ACM*.**15**: 1–7. doi:10.1145/321439.321440. - ↑ Hamming, R. W. (1969). "One Man's View of Computer Science".
*Journal of the ACM*.**16**: 3–12. doi:10.1145/321495.321497. - ↑ Minsky, M. (1970). "Form and Content in Computer Science (1970 ACM turing lecture)".
*Journal of the ACM*.**17**(2): 197–215. doi:10.1145/321574.321575. - ↑ Wilkinson, J. H. (1971). "Some Comments from a Numerical Analyst".
*Journal of the ACM*.**18**(2): 137–147. doi:10.1145/321637.321638. - ↑ McCarthy, J. (1987). "Generality in artificial intelligence".
*Communications of the ACM*.**30**(12): 1030–1035. doi:10.1145/33447.33448. - ↑ Dijkstra, E. W. (1972). "The humble programmer".
*Communications of the ACM*.**15**(10): 859–866. doi:10.1145/355604.361591. - ↑ Bachman, C. W. (1973). "The programmer as navigator".
*Communications of the ACM*.**16**(11): 653–658. doi:10.1145/355611.362534. - ↑ Knuth, D. E. (1974). "Computer programming as an art".
*Communications of the ACM*.**17**(12): 667–673. doi:10.1145/361604.361612. - ↑ Newell, A.; Simon, H. A. (1976). "Computer science as empirical inquiry: Symbols and search".
*Communications of the ACM*.**19**(3): 113. doi:10.1145/360018.360022. - ↑ Rabin, M. O.; Scott, D. (1959). "Finite Automata and Their Decision Problems".
*IBM Journal of Research and Development*.**3**(2): 114. doi:10.1147/rd.32.0114. - ↑ Rabin, M. O. (1977). "Complexity of computations".
*Communications of the ACM*.**20**(9): 625–633. doi:10.1145/359810.359816. - ↑ Scott, D. S. (1977). "Logic and programming languages".
*Communications of the ACM*.**20**(9): 634–641. doi:10.1145/359810.359826. - ↑ Backus, J. (1978). "Can programming be liberated from the von Neumann style?: A functional style and its algebra of programs".
*Communications of the ACM*.**21**(8): 613–641. doi:10.1145/359576.359579. - ↑ Floyd, R. W. (1979). "The paradigms of programming".
*Communications of the ACM*.**22**(8): 455–460. doi:10.1145/359138.359140. - ↑ Iverson, K. E. (1980). "Notation as a tool of thought".
*Communications of the ACM*.**23**(8): 444–465. doi:10.1145/358896.358899. - ↑ Hoare, C. A. R. (1981). "The emperor's old clothes".
*Communications of the ACM*.**24**(2): 75–83. doi:10.1145/358549.358561. - ↑ Codd, E. F. (1982). "Relational database: A practical foundation for productivity".
*Communications of the ACM*.**25**(2): 109–117. doi:10.1145/358396.358400. - ↑ Cook, S. A. (1983). "An overview of computational complexity".
*Communications of the ACM*.**26**(6): 400–408. doi:10.1145/358141.358144. - ↑ "A.M. Turing Award Laureate - Kenneth Lane Thompson".
*amturing.acm.org*. Retrieved 4 November 2018. - ↑ "A.M. Turing Award Laureate - Dennis M. Ritchie".
*amturing.acm.org*. Retrieved 4 November 2018. - ↑ Milner, R. (1993). "Elements of interaction: Turing award lecture".
*Communications of the ACM*.**36**: 78–89. doi:10.1145/151233.151240. - ↑ Stearns, R. E. (1994). "Turing Award lecture: It's time to reconsider time".
*Communications of the ACM*.**37**(11): 95–99. doi:10.1145/188280.188379. - ↑ Reddy, R. (1996). "To dream the possible dream".
*Communications of the ACM*.**39**(5): 105–112. doi:10.1145/229459.233436. - ↑ "A.M. Turing Award Laureate - Manuel Blum".
*amturing.acm.org*. Retrieved 4 November 2018. - ↑ "A.M. Turing Award Laureate - Amir Pnueli".
*amturing.acm.org*. Retrieved 4 November 2018. - ↑ "A.M. Turing Award Laureate - Douglas Engelbart".
*amturing.acm.org*. Retrieved 4 November 2018. - ↑ 2007 Turing Award Winners Announced
- ↑ Pearl, Judea (2011).
*The Mechanization of Causal Inference: A "mini" Turing Test and Beyond*(mp4).*ACM Turing Award Lectures*. doi:10.1145/1283920.2351636 (inactive 2020-01-22). ISBN 978-1-4503-1049-9. - ↑ "Judea Pearl". ACM.
- ↑ "Turing award 2012". ACM. Archived from the original on 2013-03-18.
- ↑ "Turing award 2013". ACM.
- ↑ Lamport, L. (1978). "Time, clocks, and the ordering of events in a distributed system" (PDF).
*Communications of the ACM*.**21**(7): 558–565. CiteSeerX 10.1.1.155.4742 . doi:10.1145/359545.359563. - ↑ "Turing award 2014". ACM.
- ↑ Diffie, W.; Hellman, M. (1976). "New directions in cryptography" (PDF).
*IEEE Transactions on Information Theory*.**22**(6): 644–654. CiteSeerX 10.1.1.37.9720 . doi:10.1109/TIT.1976.1055638. - ↑ "Cryptography Pioneers Receive 2015 ACM A.M. Turing Award". ACM.
- ↑ "Turing award 2016". ACM.
- ↑ "Pioneers of Modern Computer Architecture Receive ACM A.M. Turing Award". ACM.
- ↑ Fathers of the Deep Learning Revolution Receive ACM A.M. Turing Award
- ↑ Pioneers of Modern Computer Graphics Recognized with ACM A.M. Turing Award – Hanrahan and Catmull’s Innovations Paved the Way for Today’s 3-D Animated Films. Retrieved March 19, 2020.

Wikimedia Commons has media related to . Turing Award |

- ACM Chronological listing of Turing Laureates
- Visualizing Turing Award Laureates
- ACM A.M. Turing Award Centenary Celebration
- ACM A.M. Turing Award Laureate Interviews
- Celebration of 50 Years of the ACM A.M. Turing Award
- ACM A.M. Turing Award (announcements, bios, lectures) by SFBayACM

This page is based on this Wikipedia article

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.