Master theorem (analysis of algorithms) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Master theorem (analysis of algorithms)" in English language version.

refsWebsite

Global rank English rank

2web.archive.org

1^st place

1doi.org

2^nd place

1semanticscholar.org

11^th place

8^th place

1dtic.mil

833^rd place

567^th place

1duke.edu

1,880^th place

1,218^th place

1mit.edu

415^th place

327^th place

1dartmouth.edu

2,242^nd place

1,513^th place

dartmouth.edu (Global: 2,242^nd place; English: 1,513^th place)

math.dartmouth.edu

Dartmouth College, http://www.math.dartmouth.edu/archive/m19w03/public_html/Section5-2.pdf

doi.org (Global: 2^nd place; English: 2^nd place)

Bentley, Jon Louis; Haken, Dorothea; Saxe, James B. (September 1980), "A general method for solving divide-and-conquer recurrences", ACM SIGACT News, 12 (3): 36–44, doi:10.1145/1008861.1008865, S2CID 40642274, archived from the original on September 22, 2017

dtic.mil (Global: 833^rd place; English: 567^th place)

Bentley, Jon Louis; Haken, Dorothea; Saxe, James B. (September 1980), "A general method for solving divide-and-conquer recurrences", ACM SIGACT News, 12 (3): 36–44, doi:10.1145/1008861.1008865, S2CID 40642274, archived from the original on September 22, 2017

duke.edu (Global: 1,880^th place; English: 1,218^th place)

cs.duke.edu

Duke University, "Big-Oh for Recursive Functions: Recurrence Relations", http://www.cs.duke.edu/~ola/ap/recurrence.html

mit.edu (Global: 415^th place; English: 327^th place)

people.csail.mit.edu

Massachusetts Institute of Technology (MIT), "Master Theorem: Practice Problems and Solutions", https://people.csail.mit.edu/thies/6.046-web/master.pdf

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Bentley, Jon Louis; Haken, Dorothea; Saxe, James B. (September 1980), "A general method for solving divide-and-conquer recurrences", ACM SIGACT News, 12 (3): 36–44, doi:10.1145/1008861.1008865, S2CID 40642274, archived from the original on September 22, 2017

web.archive.org (Global: 1^st place; English: 1^st place)

Bentley, Jon Louis; Haken, Dorothea; Saxe, James B. (September 1980), "A general method for solving divide-and-conquer recurrences", ACM SIGACT News, 12 (3): 36–44, doi:10.1145/1008861.1008865, S2CID 40642274, archived from the original on September 22, 2017
Chee Yap, A real elementary approach to the master recurrence and generalizations, Proceedings of the 8th annual conference on Theory and applications of models of computation (TAMC'11), pages 14–26, 2011. Online copy.

Master theorem (analysis of algorithms) (English Wikipedia)

dartmouth.edu (Global: 2,242nd place; English: 1,513th place)

math.dartmouth.edu

doi.org (Global: 2nd place; English: 2nd place)

dtic.mil (Global: 833rd place; English: 567th place)

duke.edu (Global: 1,880th place; English: 1,218th place)