|
1977 – John Backus
Citation
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.
1978 – Robert W Floyd
Citation
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.
1979 – Kenneth E. Iverson
Citation
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.
1980 – C. Antony R. Hoare
Citation
For his fundamental contributions to the definition and design of programming languages.
1981 – Edgar F. Codd
Citation
For his fundamental and continuing contributions to the theory and practice of database management systems. He originated the relational approach to database management in a series of research papers published commencing in 1970. His paper "A Relational Model of Data for Large Shared Data Banks" was a seminal paper, in a continuing and carefully developed series of papers. Dr. Codd built upon this space and in doing so has provided the impetus for widespread research into numerous related areas, including database languages, query subsystems, database semantics, locking and recovery, and inferential subsystems.
1982 – Stephen A Cook
Citation
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.
1983 – Dennis M. Ritchie See the ACM Author Profile in the Digital Library
Citation
For their development of generic operating systems theory and specifically for the implementation of the UNIX operating system.
1983 – Kenneth Lane Thompson
Citation
For their development of generic operating systems theory and specifically for the implementation of the UNIX operating system.
1984 – Niklaus E Wirth
Citation
For developing a sequence of innovative computer languages, EULER, ALGOL-W, MODULA and PASCAL. PASCAL has become pedagogically significant and has provided a foundation for future computer language, systems, and architectural research.
1985 – Richard M Karp
Citation
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. Karp introduced the now standard methodology for proving problems to be NP-complete which has led to the identification of many theoretical and practical problems as being computationally difficult.
1986 – Robert E Tarjan
Citation
For fundamental achievements in the design and analysis of algorithms and data structures.
1986 – John E Hopcroft
Citation
For fundamental achievements in the design and analysis of algorithms and data structures.
[source:acm.org] |