Richard Edwin Stearns
Distinguished Professor Emeritus
RESUME (2011)
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, No.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, No. 1 (April 2003), 107-136
Deterministic verses Nondeterministic Time and Lower Bound Problems
Richard E. Stearns
Journal of the ACM 50, No. 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, No. 2 (April 1996), 448-476
It's Time to Reconsider Time
Richard Edwin Stearns
Communications of the ACM 37. No. 11 (November 1994), 95-99
Power Indicies and Easier Hard Problems
Richard E. Stearns and Harry B. Hunt III
Mathematical Systems Theory 23. (1990), 209-225
Memory-bounded Game-playing Devices
Richard E. Stearns
Technical Report No. 547, The Econimic Series, IMSSS, Stanford University, July 1989
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