ACM Distinguished Service Award
USA - 2013
citation
For their long-standing work as series editors of the Springer Lecture Notes in Computer Science (LNCS) -- under their stewardship a most important venue for disseminating innovative research in the initial decades of the field of computer science.
ACM Fellows
USA - 1994
citation
In recognition of their seminal paper which established the foundations for the field of computational complexity theory.
ACM A. M. Turing Award
USA - 1993
READ FULL CITATION AND ESSAYcitation
With Richard E. Stearns, in recognition of their seminal paper which established the foundations for the field of computational complexity theory.
The A.M. Turing Award is presented to Juris Hartmanis and Richard E. Stearns in recognition of their seminal joint research which established the foundations for the field of computational complexity theory. In their paper On the Computational Complexity of Algorithms (Transactions of the American Mathematical Society, vol. 117, No. 5, May 1965, pp. 285-306) they provided a precise definition of the complexity measure defined by computation time on Turing machines and developed a theory of complexity classes. The paper sparked the imagination of many computer scientists and led to the establishment of complexity theory as a fundamental part of the discipline.