Juris Hartmanis

from Wikipedia, the free encyclopedia
Juris Hartmanis (2002)

Juris Hartmanis (born July 5, 1928 in Riga , Latvia ) is a Latvian - American computer scientist who, together with Richard E. Stearns, received the Turing Award in 1993 for his research achievements in the field of complexity theory .


After the Second World War , Hartmanis first fled to Germany . He earned a diploma in physics from the University of Marburg and emigrated to the United States of America , where he obtained a master's degree in applied mathematics from the University of Missouri-Kansas City . Eventually he earned a Ph.D. from Caltech in 1955. in mathematics with Robert Dilworth .

He then worked for the General Electric Research Laboratory, where he researched and taught principles of computer science. In 1964 he published and Richard E. Stearns, the groundbreaking for the complexity theory and eponymous paper Computational complexity of recursive sequences (in 1965 as On the computational complexity of algorithms republished), in which, inter alia DTIME and general complexity classes and an early speedup theorem introduced . Together with Phil Lewis, Stearns and Hartmanis introduced not only time but also space complexity in 1965 .

In 1965 he became a professor at Cornell University . One of Hartmanis' PhD students is Neil Immerman ( Gödel Prize 1995).

Hartmanis is a member of the Science Board and Science Steering Committee of the Santa Fe Institute .



  • with Richard E. Stearns : On the computational complexity of algorithms. In: Transactions of the American Mathematical Society. Vol. 117, 1965, pp. 285–306 ( PDF; 2018 kB ).
  • with Richard E. Stearns & Phil M. Lewis: Hierarchies of Memory Limited Computations. In: Proceedings of the Sixth Annual IEEE Symposium on Switching Circuit Theory and Logical Design. Ann Arbor (Mich.) 1965, pp. 179–190 ( PDF file; 388 kB ).

Web links