2026 Richard Edwin Stearns: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	36	10994	10684	4574	4382	119	10342

Research.com Recognitions

1994 - ACM Fellow In recognition of their seminal paper which established the foundations for their field of computation theory.
1993 - A. M. Turing Award With Juris Hartmanis, in recognition of their seminal paper which established the foundations for the field of computational complexity theory.

Overview

Richard Edwin Stearns is affiliated with the University at Albany, State University of New York in the United States. Their work spans primarily the field of Computer Science, with significant contributions across various subfields and topics within that domain.

Their research includes areas such as:

Game Theory and Applications
Opinion Dynamics and Social Influence
Complex Network Analysis Techniques
Algorithms and Data Compression
Evolutionary Game Theory and Cooperation
Semigroups and Automata Theory
Cellular Automata and Applications

Subfields of study highlighted in their work encompass:

Statistical and Nonlinear Physics
Artificial Intelligence
Computational Theory and Mathematics
Management Science and Operations Research
Sociology and Political Science

Frequent collaborators in their research output include:

Madhav Marathe
Daniel J. Rosenkrantz
Anil Vullikanti
S. S. Ravi
Zirou Qiu

Stearns has published in a range of venues, with multiple papers appearing in the following:

Proceedings of the AAAI Conference on Artificial Intelligence
arXiv (Cornell University)
Theory of Computing Systems
SSRN Electronic Journal
Proceedings of the National Academy of Sciences

Recent publications include:

"Fundamental limitations on efficiently forecasting certain epidemic measures in network models" (2022) in Proceedings of the National Academy of Sciences
"Pumping Lemmas Can be 'Harmful'" (2024) in Theory of Computing Systems
"On the computational and descriptional complexity of multi-pattern languages" (2025) in Theoretical Computer Science
"Synchronous Dynamical Systems on Directed Acyclic Graphs: Complexity and Algorithms" (2024) in ACM Transactions on Computation Theory
"On Productiveness and Complexity in Computable Analysis Through Rice-Style Theorems for Real Functions" (2024) in Mathematics

Stearns has been recognized with awards including:

ACM Fellow (1994) for work foundational to computation theory
A. M. Turing Award (1993) jointly with Juris Hartmanis for seminal contributions establishing foundations of computational complexity theory

Best Publications

An analysis of several heuristics for the traveling salesman problem

Daniel J. Rosenkrantz;Richard Edwin Stearns;Philip M. Lewis

1490
Citations
On the computational complexity of algorithms

J. Hartmanis;R. E. Stearns

1306
Citations
Repeated Games with Incomplete Information

Robert J. Aumann;Michael Maschler;Richard E. Stearns

1098
Citations
Algebraic Structure Theory of Sequential Machines

Juris Hartmanis;R. E. Stearns

747
Citations
Syntax-Directed Transduction

P. M. Lewis;R. E. Stearns

503
Citations
Hierarchies of memory limited computations

R. E. Stearns;J. Hartmanis;P. M. Lewis

477
Citations
NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs

Harry B Hunt;Madhav V Marathe;Venkatesh Radhakrishnan;S.S Ravi

396
Citations
Two-Tape Simulation of Multitape Turing Machines

F. C. Hennie;R. E. Stearns

358
Citations
Properties of deterministic top-down grammars

Daniel J. Rosenkrantz;Richard Edwin Stearns

355
Citations
Memory bounds for recognition of context-free and context-sensitive languages

P. M. Lewis;R. E. Stearns;J. Hartmanis

266
Citations
Compiler Design Theory

nd Philip M. Lewis;Daniel J. Rosenkrantz;Richard E. Stearns

221
Citations
Approximate algorithms for the traveling salesperson problem

D. J. Rosenkrantz;R. E. Stearns;P. M. Lewis

217
Citations
On the State Assignment Problem for Sequential Machines II

R. E. Stearns;J. Hartmanis

214
Citations
The Voting Problem

Richard Stearns

207
Citations
Attributed translations

P. M. Lewis;D. J. Rosenkrantz;R. E. Stearns

196
Citations
On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata

Richard Edwin Stearns;Harry B. Hunt

170
Citations
A regularity test for pushdown machines

Richard Edwin Stearns

165
Citations
Concurrency control for database systems

R. E. Stearns;P. M. Lewis;D. J. Rosenkrantz

161
Citations
Convergent transfer schemes for $N$-person games

R. E. Stearns

155
Citations
Distributed database concurrency controls using before-values

Richard E. Stearns;Daniel J. Rosenkrantz

143
Citations
A System Level Concurrency Control for Distributed Database Systems.

Daniel J. Rosenkrantz;Richard Edwin Stearns;Philip M. Lewis

8
Citations

Frequent Co-Authors

Daniel J. Rosenkrantz University of Virginia

Madhav V. Marathe University of Virginia

S. S. Ravi University of Virginia

Juris Hartmanis Cornell University

Christopher L. Barrett University of Virginia

Andrew Chi-Chih Yao Tsinghua University

External Links

Wikipedia of Richard Edwin Stearns Personal website of Richard Edwin Stearns

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Pursuing a Computer Science degree online is increasingly popular for its flexibility and accessibility. Students can explore cheap online degrees fast, which allow them to save on tuition and graduate sooner. These accelerated programs are ideal for those eager to jumpstart their careers without a lengthy time commitment.

If your academic history includes a less-than-perfect GPA, don’t worry. Many online colleges that accept low gpa are available, offering a second chance to succeed and earn a respected qualification. This inclusivity helps open doors for a wider range of students.

For learners interested in tech, a fast track computer science degree enables rapid skill development aligned with industry needs. Graduates of these programs can pursue numerous roles in software development, data analysis, cybersecurity, and more.

Considering a broader scientific path? See what options are available with a technology or science background, such as exploring what jobs can you get with an environmental science degree. The tech field connects to diverse, impactful career pathways, both within and beyond computer science.