Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Stephen Cook

Also Known As Stephen Arthur Cook · Stephen A. Cook · S. A. Cook
Theory of Computation

Stephen Arthur Cook is an American-Canadian computer scientist and mathematician who has made significant contributions to complexity theory and proof complexity. He is a university professor emeritus at the University of Toronto. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/

Facts
Birth Year
1939 1
Birth Date
1939-12-14 2
Award
Gerhard Herzberg Canada Gold Medal for Science and Engineering 1
Award
Officer of the Order of Canada 1
Award
Gödel Lecturer 1
Award
Fellow of the Royal Society 1
Award
Turing Award 1
Award
ACM Fellow 1
Award
John L. Synge Award 1
Award
Fellow of the Royal Society of Canada 1
Award
CRM-Fields-PIMS prize 1
Award
BBVA Foundation Frontiers of Knowledge Award 1
Award
Order of Ontario 1
Contribution Kind
Theory 2
Highest Honour
Turing Award 2
Connections

Credited

Source Toom-Cook multiplication (Wikipedia)

In Field

Source Wikipedia: Stephen Cook

Invented

Stephen Cook improved Andrei Toom's fast multiplication algorithm in his 1966 doctoral thesis at Harvard.

Source Wikipedia: Stephen Cook

Long-Form Articles

In the Other Atlases

Same As

Also in Mathematics Atlas: the same subject.

Is Discussed By

Also in Science Atlas: which discusses this subject.

Source Wikipedia: Stephen Cooktier 2

Nationality

Also in Geography Atlas: the nationality of this subject.

Also in Geography Atlas: the nationality of this subject.

Sources
1. Wikidata: Stephen Cook
  • Wikidata Q62870, resolved via en.wikipedia pageprops (wave rule R-L)
  • Wikidata Q62870 P569 (date of birth)
View the Source
2. Wikipedia: Stephen Cook
Wikimedia Foundation
  • Lead section
    Stephen Arthur Cook (born December 14, 1939) is an American-Canadian computer scientist and mathematician who has made significant contributions to the fields of complexity theory and proof complexity.
  • Infobox, Born
    December 14, 1939
  • Lead paragraph
    Stephen Arthur Cook (born December 14, 1939) is an American-Canadian computer scientist and mathematician who has made significant contributions to the fields of complexity theory and proof complexity.
  • Infobox: awards
    Turing Award (1982) Gödel Lecture (1999) CRM-Fields-PIMS prize (1999) John L. Synge Award (2006) Gerhard Herzberg Canada Gold Medal for Science and Engineering (2012) Order of Canada, Officer of Order of Canada (2015) BBVA Foundation Frontiers of Knowledge Award (2015)
View the Source
Toom-Cook multiplication (Wikipedia)
Credited: Toom-Cook Multiplication, Lead sentence
Quote, Credited: Toom-Cook Multiplication, Lead sentence
Toom-Cook, sometimes known as Toom-3, named after Andrei Toom, who introduced the new algorithm with its low complexity, and Stephen Cook, who cleaned the description of it, is a multiplication algorithm for large integers.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.