Juris Hartmanis was a Latvian-born American computer scientist and computational theorist who, along with Richard E Sterns, received the 1993 ACM Turing Award "in recognition of their seminal part which established the foundations for the field of computational complexity theory". He was among the group of CS&E that contributed to the definition of the 'Bootlean hierarchy'.
As a child, Juris with his mother and siblings became refugees during WWII after they fled Latvia while his father died in prison. He was able to get the equivalent of a master's degree in physics from the University of Marburg in 1949. Then he immigrated to the United States[1], and in 1951, he received a master's degree in applied mathematics from the University of Kansas City. In 1955, he received his Ph. D in mathematics from Caltech.
He became a naturalized U.S. citizen in 1956 choosing the name George Hartman Hartmanis.[2][3]
After stints teaching at Cornell and then Ohio State Universities, he went to work for General Electric Research Labs in Schenectady, NY from 1958-1965. Later, he became a professor at Cornell and helped to found its computer science department in 1965. Through his various and numerous board memberships, he worked to advance computer science and engineering education. He worked with other CS&E to co-define complexity classes based on space usage and proved the first space hierarchy theorem as well as the essential idea (log n)² that led to Savitch's theorem on space complexity.[4]
From 1996-98, he served as Assistant Director of the National Science Foundation, where he headed the Directorate for Computer and Information Science and Engineering.
He passed away on 29 Jul 2022 in New York. His obituary was published online by Bangs Funeral Home.
H > Hartmanis > Juris Hartmanis
Categories: Pleasant Grove Cemetery, Ithaca, New York | General Electric, Schenectady, New York | Computer History | Computer Scientists | Turing Award for Computer Science | Notables