Analysis of algorithms (English Wikipedia)

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

Last modified: 00:03:55, 24 July 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

44books.google.com

3^rd place

3^rd place

22web.archive.org

1^st place

1^st place

4^th place

4^th place

194^th place

182^nd place

6^th place

6^th place

11stackexchange.com

4,114^th place

3,027^th place

11rjlipton.wordpress.com

low place

low place

archive.org (Global: 6^th place; English: 6^th place)

Alfred V. Aho; John E. Hopcroft; Jeffrey D. Ullman (1974). The design and analysis of computer algorithms. Addison-Wesley Pub. Co. ISBN 9780201000290., section 1.3

books.google.com (Global: 3^rd place; English: 3^rd place)

Juraj Hromkovič (2004). Theoretical computer science: introduction to Automata, computability, complexity, algorithmics, randomization, communication, and cryptography. Springer. pp. 177–178. ISBN 978-3-540-14015-3.
Giorgio Ausiello (1999). Complexity and approximation: combinatorial optimization problems and their approximability properties. Springer. pp. 3–8. ISBN 978-3-540-65431-5.
Wegener, Ingo (2005), Complexity theory: exploring the limits of efficient algorithms, Berlin, New York: Springer-Verlag, p. 20, ISBN 978-3-540-21045-0
Robert Endre Tarjan (1983). Data structures and network algorithms. SIAM. pp. 3–7. ISBN 978-0-89871-187-5.

rjlipton.wordpress.com (Global: low place; English: low place)

How To Avoid O-Abuse and Bribes Archived 2017-03-08 at the Wayback Machine, at the blog "Gödel's Lost Letter and P=NP" by R. J. Lipton, professor of Computer Science at Georgia Tech, recounting idea by Robert Sedgewick

stackexchange.com (Global: 4,114^th place; English: 3,027^th place)

cstheory.stackexchange.com

Examples of the price of abstraction?, cstheory.stackexchange.com

stanford.edu (Global: 194^th place; English: 182^nd place)

www-cs-faculty.stanford.edu

"Knuth: Recent News". 28 August 2016. Archived from the original on 28 August 2016.

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

"Knuth: Recent News". 28 August 2016. Archived from the original on 28 August 2016.
How To Avoid O-Abuse and Bribes Archived 2017-03-08 at the Wayback Machine, at the blog "Gödel's Lost Letter and P=NP" by R. J. Lipton, professor of Computer Science at Georgia Tech, recounting idea by Robert Sedgewick

worldcat.org (Global: 4^th place; English: 4^th place)

worldcat.org

Cormen, Thomas H., ed. (2009). Introduction to algorithms (3rd ed.). Cambridge, Mass: MIT Press. pp. 44–52. ISBN 978-0-262-03384-8. OCLC 311310321.

search.worldcat.org

Cormen, Thomas H., ed. (2009). Introduction to algorithms (3rd ed.). Cambridge, Mass: MIT Press. pp. 44–52. ISBN 978-0-262-03384-8. OCLC 311310321.