sign in sign up
<<
Home , Adi Shamir, Alan Kay, Amir Pnueli, Andrew Yao, Douglas Engelbart, Joseph Sifakis

COMP 516 COMP 516 Research Methods in Research Methods in Computer Science Lecture 3: Who is Who in Computer Science Research

Dominik Wojtczak Dominik Wojtczak

Department of Computer Science University of Liverpool Department of Computer Science University of Liverpool

1 / 24 2 / 24

Prizes and Awards Alan M. Turing (1912-1954)

Scientific achievement is often recognised by prizes and awards

Conferences often give a best paper award, sometimes also a best “The father of modern computer science” student paper award In 1936 introduced Turing machines, as a thought Example: experiment about limits of mechanical computation ICALP Best Paper Prize (Track A, B, C) (Church-Turing ) For the best paper, as judged by the program committee Gives rise to the concept of Turing completeness and Professional organisations also give awards based on varying Turing reducibility criteria In 1939/40, Turing designed an electromechanical machine which Example: helped to break the german Enigma code Roger Needham Award His main contribution was an cryptanalytic machine which used Made annually for a distinguished research contribution in computer logic-based techniques science by a UK based researcher within ten years of their PhD In the 1950 paper ‘Computing machinery and intelligence’ Turing Arguably, the most prestigious award in Computer Science is the introduced an experiment, now called the Turing test A. M. 2012 is the Alan Turing year! 3 / 24 4 / 24 Turing Award Turing Award Winners

What contribution have the following people made? The A. M. Turing Award is given annually by the Association for Who among them has received the Turing Award? Computing Machinery to an individual selected for contributions of a technical nature made Frances E. Allen X X to the computing community. The contributions should be of lasting Leonard M. Adleman X Donald E. Knuth X and major technical importance to the computer field.  X Timothy J. Berners-Lee  John Nash  The Association for Computing Machinery (ACM) is a society for Vinton G. Cerf X Lawrence Page  computing founded in 1947. It is the largest and most prestigious Edmund Clarke X Alan J. Perlis X scientific and educational computing society, with more than 100,000 Edgar F. Codd X X members world-wide. Stephen A. Cook X Dennis M. Ritchie X Edsger W. Dijkstra X Ronald R. Rivest X Lawrence J. Ellison  X X Richard M. Stallman  Paul Erdos¨  X William H. Gates III  X James A. Gosling   Stephen Hawking  5 / 24 X 6 / 24

The Ones Who Haven’t Made It (Yet) The Ones Who Haven’t Made It (Yet) Leonard Kleinrock One of the three inventors of packet-switched networks, along Lawrence Page with and in the early 1960’s Co-founder, together with Sergey Brin, of Google; developed the Timothy J. Berners-Lee PageRank in 1998 on which Google is based Together with invented the in Richard M. Stallman 1989 freedom activist, hacker, software developer; lauched Lawrence J. Ellison the GNU Project in 1983 Co-founder and CEO of the database software company Oracle Paul Erdos¨ William H. Gates III Hungarian mathematician, co-author of around 1525 articles Co-founder, together with Paul Allen, of Microsoft; held the together with 511 different collaborators. Worked on positions of CEO, chief software architect, and chairman combinatorics, graph theory, approximation theory, and James A. Gosling probability theory. Invented Java language in 1994; devised original design of Java John Nash and implemented its original compiler and Nobel prize winner in economics, Nash equilibrium is a key Moshe Vardi concept in game theory. Algorithmic game theory is a very active Author of more than 400 papers in the field of logic in computer area of research in computer science. science and automatic program verification. 7 / 24 8 / 24 Alan J. Perlis

Andrew Chi-Chih Yao First recipient of the Turing award in 1966 For his influence in the area of advanced programming techniques and compiler Received the Turing award in 2000. construction. In recognition of his fundamental contributions One of the developers of the ALGOL to the , including the complexity-based theory of pseudorandom number generation, , and communication complexity. Yao’s principle: to establish a lower bound on the performance of randomized , it suffices to find an appropriate distribution of difficult inputs, and to prove that no deterministic algorithm can perform well against that distribution.

9 / 24 10 / 24

Frances E. Allen Vinton G. Cerf, Robert E. Kahn

Received the Turing award in 2006 “For pioneering contributions to the theory and practice of optimizing compiler techniques that laid the foundation for modern optimizing compilers and automatic parallel execution.” Received the Turing award in 2004 First woman to receive the award ”For pioneering work on , including the design Her 1966 paper on ‘Program Optimization’ and a 1971 paper with John and implementation of the ’s basic communications Cocke provide the conceptual basis for the systematic analysis and protocols, TCP/IP, and for inspired leadership in networking.” transformation of computer programs

Basis for modern machine- and language-independent program optimizers Led the design and implementation of the Transmission Control Protocol and Internet Protocol (TCP/IP) Lead an IBM project which developed the concept of program dependence graph, the primary structuring method used by most parallelizing compilers Basis for current internetworking

11 / 24 12 / 24 Alan Kay Leonard M. Adleman, Ronald R. Rivest, Adi Shamir

Received the Turing award in 2003 ”For pioneering many of the ideas at the root of contemporary object-oriented programming languages, leading the team that developed , and for fundamental contributions to personal computing.” Received the Turing award in 2002 ”For their ingenious contribution for making public-key Development started in 1969, publicly available since 1980 cryptography useful in practice.” First complete dynamic object-oriented programming Created most widely used public-key cryptography system, RSA, in Influenced the design ofC ++ and Java 1977

Included a complete visual programming environment described an equivalent system in an internal GCHQ Envisaged to be part of a ‘user-centered’ approach to computing document in 1973, but it was never deployed and kept secret until 1997

13 / 24 14 / 24

Douglas Engelbart Amir Pnueli

Received the Turing award in 1996 ”For seminal work introducing into computing science and for outstanding Received the Turing award in 1997 contributions to program and system ”For an inspiring vision of the future of interactive verification.” computing and the invention of key technologies to help realize this vision.” Major breakthrough in the verification and certification of concurrent and reactive systems Vision of computer networked working environment Landmark 1977 paper ‘The Temporal Logic of Programs’ Instrumental in revolution. Invented: in Proc. 18th IEEE Symp. Found. of Comp. Sci., 1977, pp. 46–57. Focus: ongoing behaviour of programs (cf. input/output behaviour) Multiple on screen windows Linked hypermedia Easily specify qualitative progress properties of concurrent programs Shared screen teleconferencing and computer aided meetings Careful logic design enables automated verification of concurrent Online publishing programs Presented in 1968 as part of the ‘mother of all demos’ 15 / 24 16 / 24 Robin Milner Dennis M. Ritchie, Ken Thompson

Received the Turing award in 1991 For three distinct and complete achievements: Received the Turing award in 1983 1 LCF, the mechanization of Scott’s Logic of For their development of generic operating Computable Functions, probably the first systems theory and specifically for the theoretically based yet practical tool for machine implementation of the Unix . assisted proof construction; 2 ML, the first language to include polymorphic type Development of UNIX began in 1969 inference together with a type-safe exception-handling mechanism; Seminal paper from 1973 on ‘The UNIX Time-Sharing System’ at 3 CCS, a general theory of concurrency. the Fourth ACM Symposium on Operating Systems Principles In addition, he formulated and strongly advanced UNIX: first commercially important portable operating system full abstraction, the study of the relationship between operational and . Usable (almost without change) across a wide range of hardware from smartphones to supercomputers

17 / 24 18 / 24

Stephen A. Cook Edmund Clarke, Allen E. Emerson,

Received the Turing award in 1982 For his advancement of our understanding of the complexity of computation in a significant and profound way. Received the Turing award in 2007 For their role in developing Model-Checking into a highly Seminal paper ‘The Complexity of Theorem Proving Procedures’ at effective verification technology that is widely adopted in the 1971 ACM SIGACT Symposium on the Theory of Computing hardware and software industries.

Laid the foundations for the theory of NP-completeness computation tree logic P 6= NP is still one of the most fundamental open problems symbolic Starting point for complexity theory

19 / 24 20 / 24 Leslie Valiant Edgar F. Codd

Received the Turing award in 2010 Received the Turing award in 1981 For transformative contributions to the theory of For his fundamental and continuing contributions computation, including the theory of probably to the theory and practice of database approximately correct (PAC) learning, the management systems. complexity of enumeration and of algebraic computation, and the theory of parallel and Developed the relational approach to database management distributed computing. Seminal paper published in 1970 on ‘A Relational Model of Data for Large Shared Data Banks’

introduced the notion of #P-completeness to explain why Provided the impetus for widespread research into numerous related enumeration and reliability problems are intractable areas, including database languages, query subsystems, database semantics, locking and recovery, and inferential subsystems

Other contributions: Boyce-Codd Normal Form Online analytical processing (OLAP) 21 / 24 22 / 24

Donald E. Knuth How to Become a Turing Award Winner

To increase your chances to become a Turing award winner it might be advantageous to work in one of the following fields: Received the Turing award in 1974 programming language design and implementation For his major contributions to the analysis of (Backus, Floyd, Hoare, Milner, Naur, Iverson (APL), Dijkstra, Naur, algorithms and the design of programming Perlis (Algol), Fortran (Backus), Pascal, Modula (Wirth), Dahl, languages. Nygaard (), Kay (Smalltalk)) program compilation (Cocke, Perlis), program optimisation (Allen) program verification (Dijkstra, Floyd, Pnueli, Clarke, Emerson, Creator ofT X typesetting system and Metafont font design system E Sifakis) Created the field of rigorous analysis of algorithms analysis and theory of algorithms including complexity theory (Blum, Cook, Hopcroft, Hartmanis, Knuth, Karp, Rabin, Scott, Author of the multi-volume book series ‘The Art of Computer Stearns, Tarjan, Valiant, Yao) Programming’ theory and practice of databases (Bachman, Codd, Gray) First volume published in 1968, seven volumes planned, currently theory and practice of operating systems (Brooks, Corbato,´ Ritchie, working on fourth volume Thompson, Lampson) One of the most highly respected references in computer science artificial intelligence (Feigenbaum, Minsky, Newell, Reddy, Simon)

23 / 24 24 / 24