Pioneers in Computer Science
Pioneers in CS
Back
Juris Hartmanis
Internet Agealgorithmstheory of computation

Juris Hartmanis

Juris Hartmanis was a Latvian-born American computer scientist and computational theorist who, with Richard E

1928 – 2022LatviaContribution: 1993

Introduction

Juris Hartmanis (born 1928) is a Latvian-American computer scientist and recipient of the Turing Award. He has made significant contributions to the field of computational complexity theory and its applications. Hartmanis co-developed the theory of computational complexity and pioneered the study of the computational complexity of sequential and parallel algorithms.

Key Achievement

A renowned computer scientist, co-founder of computational complexity theory alongside Richard E. Stearns. They proved the Time Hierarchy Theorem and were awarded the Turing Award in 1993 for their pioneering work. Hartmanis also significantly contributed to academia as a long-serving faculty member at Cornell University.

Biography

Juris Hartmanis was a Latvian-born American computer scientist and computational theorist who, with Richard E. Stearns, received the 1993 ACM Turing Award "in recognition of their seminal paper which established the foundations for the field of computational complexity theory".

Awards

Fellow of the American Association for the Advancement of Science1981
Fellow of the American Academy of Arts and Sciences1992
Turing Award1993
ACM Fellow1994
honorary doctor of TU Dortmund1995
honorary doctorate1999
Grand Medal of the Latvian Academy of Sciences2001
Fellow of the American Mathematical Society2013
ACM Distinguished Service Award2013

Institutions

Cornell University

1955–1957

Ohio State University

1957–1958

General Electric

1958–1965

Education

University of Marburg

Candidate of Philosophy

1949

University of Missouri–Kansas City

Master of Arts

1951

California Institute of Technology

Doctor of Philosophy

1955

Massachusetts Institute of Technology