Changes

* [[Parallel Search]]

* [[Principal Variation Search]]

* [[Retrograde Analysis]]

* [[Search]]

* [[Mathematician#Ershov|Andrei P. Ershov]], [[Donald Knuth]] (Eds.) ('''1981'''). ''Algorithms in Modern Mathematics and Computer Science''. Proceedings, [https://en.wikipedia.org/wiki/Urgench Urgench], Uzbek SSR, September 16-22, 1979. [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science], Vol. 122, Springer » [[Donald Knuth#ErshovArchive|Ershov Archive]]

* [[Michel Gondran]], [Mathematician#MMinoux|Michel Minoux]], [https://en.wikipedia.org/wiki/Steven_Vajda Steven Vajda] ('''1984'''). ''[http://portal.acm.org/citation.cfm?id=817 Graphs and Algorithms]''. [https://en.wikipedia.org/wiki/John_Wiley_%26_Sons John Wiley & Sons], [http://books.google.com/books?id=2uhQAAAAMAAJ google], [http://www.amazon.com/Graphs-Algorithms-Discreet-Mathematics-1-484/dp/0471103748 amazon]

==1990 ...==

* [[John Tromp]] ('''1993'''). ''[http://homepages.cwi.nl/~tromp/thesis.html Aspects of Algorithms and Complexity]''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Amsterdam University of Amsterdam], advisor [[Mathematician#PVitany|Paul Vitányi]]

* [[Donald Knuth]] ('''2000'''). ''[http://www-cs-faculty.stanford.edu/~uno/aa.html Selected Papers on Analysis of Algorithms]''. [http://web.stanford.edu/group/cslipublications/cslipublications/site/CSIN.shtml CSLI lecture notes series] 102

* [[Richard C. T. Lee|R. C. T. Lee]], [http://www.arnetminer.org/viewperson.do?naid=833742&keyword=S.%20S.%20Tseng S. S. Tseng], [http://www.arnetminer.org/viewperson.do?naid=1257780&keyword=R.%20C.%20Chang R. C. Chang], [http://www.arnetminer.org/viewperson.do?naid=1419034&keyword=Yin-Te%20Tsai Y. T. Tsai] ('''2005'''). ''Introduction to the Design and Analysis of Algorithms, a Strategic Approach''. [https://en.wikipedia.org/wiki/McGraw-Hill McGraw-Hill], [http://www.amazon.com/Introduction-Design-Analysis-Algorithms-Y-T-Tsai/dp/0071243461 amazon]

* [[Mathematician#SDasgupta|Sanjoy Dasgupta]], [[Mathematician#CHPapadimitriou|Christos H. Papadimitriou]], [[Mathematician#UVVazirani|Umesh Vazirani]] ('''2006'''). ''[http://www.cs.berkeley.edu/%7Evazirani/algorithms.html Algorithms]''. [https://en.wikipedia.org/wiki/McGraw-Hill McGraw-Hill], [http://www.amazon.com/gp/product/0073523402?ie=UTF8&tag=ebookdire-20&link_code=as3&camp=211189&creative=373489&creativeASIN=0073523402 amazon]

* [http://info.iut-bm.univ-fcomte.fr/staff/bahi/ Jacques Bahi], [http://www.loria.fr/%7Econtasss/ Sylvain Contassot-Vivier], [[Raphaël Couturier]] ('''2007'''). ''[http://www.crcpress.com/ecommerce_product/product_detail.jsf?catno=C808X&isbn=0000000000000&parent_id=&pc= Parallel Iterative Algorithms: From Sequential to Grid Computing]''. [https://en.wikipedia.org/wiki/Chapman_%26_Hall Chapman & Hall]/CRC Numerical Analysis and Scientific Computing Series

* [[Donald Knuth]] ('''2010'''). ''[http://www-cs-faculty.stanford.edu/~uno/da.html Selected Papers on Design of Algorithms]''. [http://web.stanford.edu/group/cslipublications/cslipublications/site/CSIN.shtml CSLI lecture notes series] 191, [https://en.wikipedia.org/wiki/Cambridge_University_Press Cambridge University Press]

* [[Mathematician#BVoecking|Berthold Vöcking]] et al. (eds.) ('''2011'''). ''[http://www.springer.com/gp/book/9783642153273 Algorithms Unplugged]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]

* [[Katja Grace]] ('''2013'''). ''Algorithmic Progress in Six Domains''. Technical report 2013-3, [https://en.wikipedia.org/wiki/Machine_Intelligence_Research_Institute Machine Intelligence Research Institute], [https://en.wikipedia.org/wiki/Berkeley,_California Berkeley, CA], [http://intelligence.org/files/AlgorithmicProgress.pdf pdf], 5 [[Games|Game Playing]], 5.1 [[Chess]], 5.2 [[Go]], 9 [[Learning|Machine Learning]]

* [https://en.wikipedia.org/wiki/Algorithm_characterizations Algorithm characterizations from Wikipedia]

* [https://en.wikipedia.org/wiki/Analysis_of_algorithms Analysis of algorithms from Wikipedia]

* [https://en.wikipedia.org/wiki/Big_O_notation Big O notation from Wikipedia]

* [https://en.wikibooks.org/wiki/Algorithms Algorithms - Wikibooks]

: [https://en.wikipedia.org/wiki/Nondeterministic_algorithm Nondeterministic algorithm]

: [https://en.wikipedia.org/wiki/Metaheuristic Metaheuristic]

: [https://en.wikipedia.org/wiki/Parallel_algorithm Parallel algorithm]

: [https://en.wikipedia.org/wiki/Quantum_algorithm Quantum algorithm]

* [https://en.wikipedia.org/wiki/Randomized_algorithm Randomized algorithm from Wikipedia]

: [https://en.wikipedia.org/wiki/Las_Vegas_algorithm Las Vegas algorithm]

* [https://en.wikipedia.org/wiki/Root-finding_algorithm Root-finding algorithm from Wikipedia]

===Graphics===

===[https://en.wikipedia.org/wiki/Linear_programming Linear Programming]===

* [https://en.wikipedia.org/wiki/Criss-cross_algorithm Criss-cross algorithm from Wikipedia]

* [https://en.wikipedia.org/wiki/Sorting_algorithm Sorting algorithm from Wikipedia]

==Complexity==

* [https://en.wikipedia.org/wiki/Category:Computational_complexity_theory Category: Computational complexity theory from Wikipedia]

* [https://en.wikipedia.org/wiki/Complexity_class Complexity class from Wikipedia]

* [http://www.ics.uci.edu/~eppstein/cgt/hard.html Computational Complexity of Games and Puzzles] by [[David Eppstein]]

* [https://en.wikipedia.org/wiki/Correctness_%28computer_science%29 Correctness (computer science) from Wikipedia]

* [https://en.wikipedia.org/wiki/Halting_problem Halting problem from Wikipedia]

: {{#evu:https://www.youtube.com/watch?v=HjR320Y4NTQ|alignment=left|valignment=top}}

'''[[Programming|Up one Level]]'''