Juris Hartmanis

**Juris Hartmanis**

Born	July 7, 1928 Riga, Latvia
Field	Computer Science
Institution	General Electric Cornell University
Notable prizes	Turing Award

Juris Hartmanis (born July 7, 1928 in Riga, Latvia) is a prominent 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".

Born in Latvia, he moved to Germany after the Second World War. He received the equivalent of a Bachelor's degree in Physics from the University of Marburg, then emigrated to the United States for his Master's degree in Applied Mathematics at the University of Kansas City (now known as the University of Missouri-Kansas City). He received his Ph.D. in Mathematics from Caltech under the supervision of Robert P. Dilworth.

Thereafter, he worked for the General Electric Research Laboratory, developing and introducing computer science principles. In 1965, he became a professor at Cornell University, where he helped to create its computer science department and was its first chairman. In 1994 he was inducted as a Fellow of the Association for Computing Machinery.

Hartmanis, J., and Stearns, R. E. On the computational complexity of algorithms. Trans. Amer. Math. Soc. 117 (1965), 285--306.

v • d • e

Turing award laureates

1966: Perlis • 67: Wilkes • 68: Hamming • 69: Minsky
1970: Wilkinson • 71: McCarthy • 72: Dijkstra • 73: Bachman • 74: Knuth • 75: Newell, Simon • 76: Rabin, Scott • 77: Backus • 78: Floyd • 79: Iverson
1980: Hoare • 81: Codd • 82: Cook • 83: Thompson, Ritchie • 84: Wirth • 85: Karp • 86: Hopcroft, Tarjan • 87: Cocke • 88: Sutherland • 89: Kahan
1990: Corbató • 91: Milner • 92: Lampson • 93: Hartmanis, Stearns • 94: Feigenbaum, Reddy • 95: Blum • 96: Pnueli • 97: Engelbart • 98: Gray • 99: Brooks
2000: Yao • 01: Dahl, Nygaard • 02: Rivest, Shamir, Adleman • 03: Kay • 04: Cerf, Kahn • 05: Naur • 06: Allen

Searching reference...