Richard Edwin Stearns
Distinguished Professor Emeritus
RESUME
Stearns/Borom Pinewood Derby Method

Downloads
Mechanism Design for Software Agents with Complete Information
Thomas O'Connell and Richard E. Stearns
Decision Support Systems 39, 2005, 197-217
Resource Bounds and Subproblem Independence
Richard E. Stearns and Harry B. Hunt III
Theory of Computing Systems 38(6), October 2005, 731-761
On Finite Strategy Sets for Finitely Repeated Zero-Sum Games
Thomas O'Connell and Richard E. Stearns
Games and Economic Behavior 43(1), April 2003, 107-136
Deterministic verses Nondeterministic Time and Lower Bound Problems
Richard E. Stearns
Journal of the ACM 50(1), January 2003, 91-95
Exploiting Structure in Quantified Formulas
Richard E. Stearns and Harry B. Hunt III
Journal of Algorithms 43, 2002, 220-263
An Algebraic Model for Combinatorial Problems
Richard E. Stearns and Harry B. Hunt III
Siam Journal on Computing 25(2), April 1996, 448-476
It's Time to Reconsider Time
Richard Edwin Stearns
Communications of the ACM 37(11), November 1994, 95-99
The Time Complexity of Very Simple Formulas with Applications
Harry Hunt III and Richard E. Stearns
SIAM Journal on Computing19(1), February 1990, 44-70
Memory-bounded Game-playing Devices
Richard E. Stearns
Technical Report No. 547, The Econimic Series, IMSSS, Stanford University, July 1989
Consistency and Serializability in Concurent Database Systems
Phillip M. Lewis, Daniel J. Rosenkrantz and Richard E. Stearns
SIAM Journal on Computing 13(3), August 1984, 508-550
An Analysis of Several Heuristics for the Traveling Salesman Problem
Danial J. Rosenkrantz, Richard E. Stearns and Phillip M. Lewis
SIAM Journal on Computing 6(3), September 1977, 563-581
also FOCS 15, 1971, 33-42
Attributed Translations
Phillip M. Lewis, Daniel J. Rosenkrantz and Richard E. Stearns
Journal of Computer and System Sciences 9(3), December 1974, 279-307
also STOC 5, 1973, 160-171
Converegemt Transfer Schemes for N-Person Games
Richard E. Stearns
Transactions of the American Mathematical Society 134(3), December 1968, 449-459
Syntax Directed Transductions
Philip M. Lewis and Richard E. Stearns
Journal of the ACM 15(3), July 1968, 21-35
also FOCS 7, 1966, 21-35
A Regularity Test for Pusudown Machines
Richard E. Stearns
Information and Control 11(1), September 1967, 323-340
Two-tape Simulation of Multitape Turing Machines
Fred C. Hennie and Richard E. Stearns
Tournal of the ACM 13(4), October 1966, 533-546
Hierarchies of Memory Limited Computations
Richard E. Stearns, Juris Hartmanis, and Philip M. Lewis II
1965 IEEE Conference Record on Switching Circuit theory and Logical Design, October 1965, 179-190
Memory Bounds for Recognition of Context-Free and Context-Sensitive Languages
Philip M. Lewis II, Richard Edwin Stearns, and Juris Hartmanis
1965 IEEE Conference Record on Switching Circuit theory and Logical Design, October 1965, 191-202
On the Computational Complexity of Algorithms
Juris Hartmanis and Richard E. Stearns
Transactions of the American Mathematics Society 117(5), May 1965, 285-306
On the Computational Complexity of Recursive Sequences
Juris Hartmanis and Richard E. Stearms
FOCS 5, 1964, 82-90