알고리즘 분석 (Korean Wikipedia)

Analysis of information sources in references of the Wikipedia article "알고리즘 분석" in Korean language version.

refsWebsite

Global rank Korean rank

4books.google.com

3^rd place

9^th place

6^th place

18^th place

1rjlipton.wordpress.com

low place

low place

1web.archive.org

1^st place

1^st place

archive.org

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

books.google.com

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

rjlipton.wordpress.com

How To Avoid O-Abuse and Bribes 보관됨 2017-03-08 - 웨이백 머신, 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

web.archive.org

How To Avoid O-Abuse and Bribes 보관됨 2017-03-08 - 웨이백 머신, 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