Richard Stearns (computer scientist)
From Wikipedia, the free encyclopedia
Richard Edwin Stearns, born July 5, 1936, is a prominent computer scientist who, with Juris Hartmanis, received the 1993 ACM Turing Award "in recognition of their seminal paper which established the foundations for the field of computational complexity theory".
Stearns is now Distinguished Professor Emeritus of Computer Science at the University at Albany, which is part of the State University of New York.
[edit] Reference
- Hartmanis, J., and Stearns, R. E. On the computational complexity of algorithms. Trans. Amer. Math. Soc. 117 (1965), 285-306.
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
 |
This biographical article relating to a computer specialist is a stub. You can help Wikipedia by expanding it. |
