Juris V Hartmanis

• Hartmanis was born in Riga, Latvia, in 1928. 
• At the end of World War II, he immigrated to Germany, where he studied physics at Philipps University of Marburg before moving to the United States.
• He created the basic principles of computational complexity theory, time hierarchy theorem, and the Berman-Hartmanis conjecture for which he is mainly known.
• After retirement, Hartmanis joined the science board of the Santa Fe Institute, an independent research group founded in 1984 to assist multidisciplinary collaboration in the study of the principles of complexity. 
• Hartmanis was elected to the American Association for the Advancement of Science (1981), the U.S. National Academy of Engineering (1989), the Latvian Academy of Sciences (1990), and the American Academy of Arts and Sciences (1992). 
• Along with a Turing Award, Hartmanis won a Bolzano Gold Medal of the Academy of Sciences of the Czech Republic (1995) and a Grand Medal of the Latvian Academy of Sciences (2001).

Text: TheBestSchools.org. 2021. The 50 Most Influential Living Computer Scientists - TheBestSchools.org. [online] Available at: <https://thebestschools.org/features/most-influential-computer-scientists/> [Accessed 31 May 2021].
Books: Algebraic Structure Theory of Sequential Machines (Prentice-Hall, 1966). Feasible Computations and Provable Complexity Properties (SIAM, 1987). Computational Complexity Theory, editor (American Mathematical Society, 1989).
Author: Sara Singh