Richard Edwin Stearns
- 1 Blum, M. A machine-independent theory of the complexity of recursive functions. J. ACM 14, 4 (Apr. 1967). 322-336. Google Scholar
Digital Library
- 2 Cook, S.A. The Complexity of theoremiproving procedures. In proceedbgs of the Third Annual ACM Symposium on Theory of Computing Shaker Heights, Ohio, 1971, pp. 151-158. Google ScholarDigital Library
- 3 Garey, M.R. and Johnson, D.S. Computers and Intractability, A Guide to the theory of NP-COmpletness. Freeman, San Francisco, 1979. Google ScholarDigital Library
- 4 Karp, R,M. Redncibifity among combinatiriaI problems. In R.E. Miller and J.W. Thatcher, eds,, Complexiy of computer Computations Plenum, N.Y. 1972, pp. 85-103Google Scholar
- 5 Hartmanis, J. and Stearns R,E. Computational complexity of recursive sequences. In Proceedigs of the Fifth Annual IEEE Symposium on Switching Circuit Theory and Logical Design, Princeton, N.J., 1964, pp. 82-90.Google ScholarDigital Library
- 6 Hartmanis, J. and Stearns, R.E. On the computitional complexity of algorithms: Trans. Amer. Math. Soc. 117, (May 1965). 285-305.Google ScholarCross Ref
- 7 Hennie; EC. and Sitearns. R.E. Two-tape simulation ofmultitape turing machines J. of ACM, 13, 10 (Oct. 1966). pp. 533- 546. Google ScholarDigital Library
- 8 Stearns, R.E., Three-person cooperative games without side payments. In M. Dresher, L.S. Shapely, and A.W. Tucker, eds., Advances in Game Theory, Annals of mathematics Studies #52, Princeton University Press 1964, pp. 307-406.Google Scholar
- 9 Stearns, R.E. and HArtmanis, J. On the state assignment problem for sequential machines II., IRE TRANs. Electr. Comput., EC-10 (Dec. 1961), 593-603.Google ScholarCross Ref
- 10 Streans, R.E., Hartmanis, J., and Lewis II, P.M. Hierarchies of memory limited computatiuons. In Proceedings of the Sixth Annual IEEE Symposium onm Switching Circuit Theory and Logical Design, Ann Arbor, Mich. 1965, pp. 179-190.Google Scholar
- 11 Stearns, R.E. abd Hunt III, H.B. Power indices and easier hard problems. Math. Syst. theory 23 (1990), 209-225.Google Scholar
- 12 Stockmeyer, L.J. and Meyer, A.R. Word problems requiring exponentialk time. In Proceedings of Fifth Annual ACM Symposium on the Theoiry of Computing, Austin, Tex., 1973, pp. 1-9. Google ScholarDigital Library
- 13 von Neuman, J. and Morgenstern. O. theory of Games and Economic Behavior, Princeton, N.J., 1944.Google Scholar
- 14 Yamada, H. Real-time computation and recursive functions not real-time compatable, IRE Trans. Electr. Comput., EC-11, (1962), 753-760.Google ScholarCross Ref
Index Terms
-
Turing Award lecture: it's time to reconsider time
-
Recommendations
-
Split-Award Auctions: Insights from Theory and Experiments
We investigate procurement in a setting in which the buyer is bound by sourcing rules. Sourcing rules may limit the minimum and maximum amounts of business that can be awarded to a single supplier or dictate the minimum number of suppliers who are awarded ...
Reviews
Norman Stanley Scott
Computational complexity is of fundamental importance in both theoretical and practical computer science. The term was coined by Juris Hartmanis and Stearns in the early 1960s. In his 1994 Turing Award lecture, Stearns reminisces about the development of computational complexity. He begins by recalling his involvement in computational complexity while employed as a mathematician at General Electric's research laboratory in Schenectady, New York, in the early 1960s. It is interesting to note that he and Hartmanis worked out their theory of computational complexity before he had ever used a computer. The subsequent development of the discipline required some new mathematics and the development of new mathematical models. In four pages, however, Stearns manages to convey the essence of this new discipline by describing in prose, and with the aid of a simple mathematical notation, the concepts of complexity and hardness. He concludes by describing his recent work on the time-based concept of the “power index” and how this leads to a new picture of the world of P, NP, PSPACE, and EXPTIME. The paper is short and concise. It will be easily digestible by the general reader. It seems to lack a clear purpose and direction, however. It is disappointing when compared with the ACM lectures of other Turing Award winners from the complexity field, including Rabin, Cook, and Karp.
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments