Newtonpedia ES
Home › Computing › Richard E. Stearns
Richard E. Stearns
Image: Wikimedia Commons

Richard E. Stearns

American computer scientist, co-founder of computational complexity theory · 1936–2026

Born
July 5, 1936
Died
August 29, 2026
Country
United States
Section
Computing
Awards
Turing Award

Biography

Richard Edwin Stearns (July 5, 1936 – August 29, 2026) was an American computer scientist. Together with Juris Hartmanis, he received the 1993 ACM Turing Award, the most prestigious honour in computing, for laying the foundations of computational complexity theory, the branch of study that asks how many resources a problem needs to be solved. His work remains one of the pillars of the discipline.

Stearns earned a bachelor's degree in mathematics from Carleton College in 1958. He then completed a PhD in mathematics at Princeton University in 1961, with a dissertation titled Three person cooperative games without side payments, supervised by Harold W. Kuhn. That research on cooperative games for three players gave him a grounding in game theory that later blended with his work in computing. Throughout his career he kept returning to three areas: computational complexity, automata theory and game theory.

His best-known contribution was a paper written with Hartmanis, titled On the Computational Complexity of Algorithms. In it, the two proposed measuring how hard an algorithm is by the time it needs to run on a Turing machine, an abstract model of a computer devised by Alan Turing to formalise computation. With that measure they took the first steps toward sorting problems into complexity classes, an idea that became central to theoretical computer science. Before this, there was no shared, rigorous way to compare how efficient algorithms were, and their proposal made that comparison possible.

The partnership with Hartmanis was the core of his recognition, but Stearns also built a long academic career. He was a professor of computer science at the University at Albany, part of the State University of New York, where he became Distinguished Professor Emeritus. In 1994 he was named a Fellow of the Association for Computing Machinery.

Stearns died on August 29, 2026, at the age of 90. His legacy underpins modern computing: whenever a programmer judges whether an algorithm is practical for large amounts of data, they rely on tools that began with that paper and the questions he and Hartmanis dared to ask.

Main contributions

  • 1961PhD dissertation at Princeton, «Three person cooperative games without side payments», supervised by Harold W. Kuhn, on cooperative games for three players.
  • 1965Paper «On the Computational Complexity of Algorithms», with Juris Hartmanis: proposes measuring an algorithm's complexity by the time it needs on a Turing machine, laying the groundwork for complexity classes.
  • 1993ACM Turing Award, shared with Juris Hartmanis, for founding computational complexity theory.
  • 1994Named a Fellow of the Association for Computing Machinery.

Teachers and students

Studied under:

Harold W. Kuhn

Taught:

Madhav Marathe

See their academic family tree →

Their contemporaries

While Richard E. Stearns was alive (1936–2026)…

Alive at the same time

Discovered or invented in those years

  • 1945
    ComputerA programmable machine that takes in data, processes it by following stored instructions, and produces results, able to switch tasks simply by running different software.
  • 1957
    Artificial satelliteAn artificial satellite is a human-made object placed in orbit around a celestial body, usually Earth, to collect information, relay signals, or carry out a specific task.
  • 1969
    InternetA global network of interconnected computer networks that communicate using the TCP/IP protocol suite.
  • 1971
    EmailA network service that lets users send and receive digital messages through addressed mailboxes, much like postal mail but electronic.
  • 1973
    Mobile phoneA handheld wireless phone that lets people make and receive calls while moving across a cellular network area.
  • 1989
    World Wide WebA system of linked documents and resources, connected by hyperlinks and accessed over the Internet with web browsers.

See this life on the timeline →

More people in Computing