אנליזה של אלגוריתמים (Hebrew Wikipedia)

Analysis of information sources in references of the Wikipedia article "אנליזה של אלגוריתמים" in Hebrew language version.

refsWebsite

Global rank Hebrew rank

4books.google.com

3^rd place

33^rd place

1web.archive.org

1^st place

6^th place

1stackexchange.com

1,983^rd place

699^th place

1rjlipton.wordpress.com

low place

low place

books.google.com

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

How To Avoid O-Abuse and Bribes, 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

cstheory.stackexchange.com

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

web.archive.org

Donald Knuth, Recent News