Stephen Cook (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Stephen Cook" in English language version.

refsWebsite

Global rank English rank

2toronto.edu

low place

8,821^st place

2claymath.org

8,402^nd place

8,241^st place

2web.archive.org

1^st place

2doi.org

2^nd place

2semanticscholar.org

11^th place

8^th place

2stackexchange.com

1,983^rd place

1,330^th place

2acm.org

1,185^th place

840^th place

1mathgenealogy.org

4,501^st place

3,002^nd place

1berkeley.edu

580^th place

462^nd place

14mhz.de

low place

1worldcat.org

5^th place

1jstor.org

26^th place

20^th place

1cup.es

low place

1informit.com

low place

7,385^th place

1avcr.cz

low place

1aslonline.org

low place

1ontario.ca

6,837^th place

4,098^th place

1cbc.ca

115^th place

82^nd place

1nserc-crsng.gc.ca

low place

1saltwire.com

9,295^th place

5,114^th place

1utoronto.ca

1,601^st place

1,117^th place

4mhz.de

Stephen Cook (1971), The Complexity of Theorem Proving Procedures (PDF) – via University of Toronto
Stephen A. Cook (2009) [1971]. "The Complexity of Theorem-Proving Procedures". Retrieved February 12, 2023.

acm.org

amturing.acm.org

Kapron, Bruce. "Stephen Arthur Cook". A. M. Turing Award. Retrieved October 23, 2018.

awards.acm.org

Association for Computing Machinery. "Stephen A Cook". awards.acm.org. Retrieved February 12, 2023.

aslonline.org

"Gödel Lecturers – Association for Symbolic Logic". Retrieved November 8, 2021.

avcr.cz

"Awarded The Bernard Bolzano Honorary Medals for Merit in the Mathematical Sciences". Medals of the CAS. Czech Academy of Sciences. Retrieved April 13, 2024.

berkeley.edu

www2.eecs.berkeley.edu

Richard Karp (2003). "A Personal View of Computer Science at Berkeley". University of California Berkeley. Retrieved February 12, 2023.

cbc.ca

Emily, Chung (February 27, 2013). "Computer scientist wins Canada's top science prize". cbc.ca. Retrieved February 27, 2013.

claymath.org

P vs. NP Archived October 14, 2013, at the Wayback Machine problem on Millennium Prize Problems page – Clay Mathematics Institute
P vs. NP Archived September 27, 2007, at the Wayback Machine problem's official description by Stephen Cook on Millennium Prize Problems

cup.es

"Logical Foundations of Proof Complexity"'s official page

doi.org

Cook, Stephen A. (May 5, 1975). "Feasibly constructive proofs and the propositional calculus (Preliminary Version)". Proceedings of seventh annual ACM symposium on Theory of computing - STOC '75. New York: Association for Computing Machinery. pp. 83–97. doi:10.1145/800116.803756. ISBN 978-1-4503-7419-4. S2CID 13309619.
Cook, Stephen A.; Reckhow, Robert A. (1979). "The Relative Efficiency of Propositional Proof Systems". The Journal of Symbolic Logic. 44 (1): 36–50. doi:10.2307/2273702. ISSN 0022-4812. JSTOR 2273702. S2CID 2187041.

informit.com

"Twenty Questions for Donald Knuth".

jstor.org

Cook, Stephen A.; Reckhow, Robert A. (1979). "The Relative Efficiency of Propositional Proof Systems". The Journal of Symbolic Logic. 44 (1): 36–50. doi:10.2307/2273702. ISSN 0022-4812. JSTOR 2273702. S2CID 2187041.

mathgenealogy.org

Stephen Cook at the Mathematics Genealogy Project

nserc-crsng.gc.ca

"Current Winner – 2012 – Stephen Cook". June 28, 2016.

ontario.ca

news.ontario.ca

"25 Appointees Named to Ontario's Highest Honour". Ministry of Citizenship and Immigration.

saltwire.com

"SaltWire | Halifax". www.saltwire.com. Retrieved February 12, 2023.

semanticscholar.org

api.semanticscholar.org

Cook, Stephen A. (May 5, 1975). "Feasibly constructive proofs and the propositional calculus (Preliminary Version)". Proceedings of seventh annual ACM symposium on Theory of computing - STOC '75. New York: Association for Computing Machinery. pp. 83–97. doi:10.1145/800116.803756. ISBN 978-1-4503-7419-4. S2CID 13309619.
Cook, Stephen A.; Reckhow, Robert A. (1979). "The Relative Efficiency of Propositional Proof Systems". The Journal of Symbolic Logic. 44 (1): 36–50. doi:10.2307/2273702. ISSN 0022-4812. JSTOR 2273702. S2CID 2187041.

stackexchange.com

cstheory.stackexchange.com

""Steve's class": origin of SC". Theoretical Computer Science – Stack Exchange.
"Who introduced the complexity class AC?". Theoretical Computer Science – Stack Exchange.

toronto.edu

cs.toronto.edu

Stephen Cook (1971), The Complexity of Theorem Proving Procedures (PDF) – via University of Toronto
Stephen A. Cook (2009) [1971]. "The Complexity of Theorem-Proving Procedures". Retrieved February 12, 2023.
"Stephen A. Cook – Home Page".

utoronto.ca

"Order of Canada: top honours go to U of T stem cell pioneer Janet Rossant, public policy leader Bob Rae". University of Toronto. July 2, 2015. Retrieved March 2, 2025.

web.archive.org

P vs. NP Archived October 14, 2013, at the Wayback Machine problem on Millennium Prize Problems page – Clay Mathematics Institute
P vs. NP Archived September 27, 2007, at the Wayback Machine problem's official description by Stephen Cook on Millennium Prize Problems

worldcat.org

search.worldcat.org

Cook, Stephen A.; Reckhow, Robert A. (1979). "The Relative Efficiency of Propositional Proof Systems". The Journal of Symbolic Logic. 44 (1): 36–50. doi:10.2307/2273702. ISSN 0022-4812. JSTOR 2273702. S2CID 2187041.