https://www.chessprogramming.org/index.php?title=Algorithms&feed=atom&action=history
Algorithms - Revision history
2024-03-29T14:24:25Z
Revision history for this page on the wiki
MediaWiki 1.30.1
https://www.chessprogramming.org/index.php?title=Algorithms&diff=24166&oldid=prev
GerdIsenberg at 08:34, 5 April 2021
2021-04-05T08:34:57Z
<p></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<col class="diff-marker" />
<col class="diff-content" />
<col class="diff-marker" />
<col class="diff-content" />
<tr style="vertical-align: top;" lang="en">
<td colspan="2" style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan="2" style="background-color: white; color:black; text-align: center;">Revision as of 08:34, 5 April 2021</td>
</tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l91" >Line 91:</td>
<td colspan="2" class="diff-lineno">Line 91:</td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==1980 ...==</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==1980 ...==</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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]]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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]]</div></td></tr>
<tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>* [[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]</div></td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>* [[Michel Gondran]], <ins class="diffchange diffchange-inline">[</ins>[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<ins class="diffchange diffchange-inline">]</ins></div></td></tr>
<tr><td colspan="2"> </td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins class="diffchange diffchange-inline">* [[Paul W. Purdom]], [[Mathematician#CABrown|Cynthia A. Brown]] ('''1985'''). ''The Analysis of Algorithms''. [https://en.wikipedia.org/wiki/Holt_McDougal#History Holt, Rinehart and Winston</ins>]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[Georgy Adelson-Velsky]], [[Vladimir Arlazarov]], [[Mikhail Donskoy]] ('''1988'''). ''[https://link.springer.com/book/10.1007%2F978-1-4612-3796-9 Algorithms for Games]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[Georgy Adelson-Velsky]], [[Vladimir Arlazarov]], [[Mikhail Donskoy]] ('''1988'''). ''[https://link.springer.com/book/10.1007%2F978-1-4612-3796-9 Algorithms for Games]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==1990 ...==</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==1990 ...==</div></td></tr>
<tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l101" >Line 101:</td>
<td colspan="2" class="diff-lineno">Line 102:</td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==2000 ...==</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==2000 ...==</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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</div></td></tr>
<tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>* [[<del class="diffchange diffchange-inline">Richard C</del>. <del class="diffchange diffchange-inline">T. Lee</del>|<del class="diffchange diffchange-inline">R</del>. <del class="diffchange diffchange-inline">C</del>. <del class="diffchange diffchange-inline">T</del>. <del class="diffchange diffchange-inline">Lee]], </del>[<del class="diffchange diffchange-inline">http</del>://<del class="diffchange diffchange-inline">www</del>.<del class="diffchange diffchange-inline">arnetminer</del>.org/<del class="diffchange diffchange-inline">viewperson.do?naid=833742&keyword=S.%20S.%20Tseng S. S. Tseng</del>], [<del class="diffchange diffchange-inline">http</del>://www.<del class="diffchange diffchange-inline">arnetminer</del>.<del class="diffchange diffchange-inline">org</del>/<del class="diffchange diffchange-inline">viewperson</del>.<del class="diffchange diffchange-inline">do?naid=1257780&keyword=R</del>.<del class="diffchange diffchange-inline">%20C.%20Chang </del>R. C. <del class="diffchange diffchange-inline">Chang</del>], <del class="diffchange diffchange-inline">[http://www.arnetminer</del>.<del class="diffchange diffchange-inline">org/viewperson.do?naid=1419034&keyword=Yin-Te%20Tsai Y. T. Tsai] </del>('''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]</div></td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>* [[<ins class="diffchange diffchange-inline">Paul W</ins>. <ins class="diffchange diffchange-inline">Purdom]], [[Mathematician#CABrown</ins>|<ins class="diffchange diffchange-inline">Cynthia A</ins>. <ins class="diffchange diffchange-inline">Brown]] ('''2004''')</ins>. <ins class="diffchange diffchange-inline">''The Analysis of Algorithms''</ins>. [<ins class="diffchange diffchange-inline">https</ins>://<ins class="diffchange diffchange-inline">en</ins>.<ins class="diffchange diffchange-inline">wikipedia</ins>.org/<ins class="diffchange diffchange-inline">wiki/Oxford_University_Press Oxford University Press</ins>], [<ins class="diffchange diffchange-inline">https</ins>://www.<ins class="diffchange diffchange-inline">amazon</ins>.<ins class="diffchange diffchange-inline">com/Analysis-Algorithms-Paul-Purdom-Jr/dp</ins>/<ins class="diffchange diffchange-inline">0195174798 amazon]</ins></div></td></tr>
<tr><td colspan="2"> </td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins class="diffchange diffchange-inline">* [[Richard C</ins>. <ins class="diffchange diffchange-inline">T</ins>. <ins class="diffchange diffchange-inline">Lee|</ins>R. C. <ins class="diffchange diffchange-inline">T. Lee]</ins>], <ins class="diffchange diffchange-inline">et al</ins>. ('''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]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[Jill Cirasella]] ('''2006'''). ''Classical and Quantum Algorithms for Finding Cycles''. M.Sc. thesis, [https://en.wikipedia.org/wiki/University_of_Amsterdam University of Amsterdam], [https://eprints.illc.uva.nl/769/1/MoL-2006-06.text.pdf pdf], [https://jillcirasella.commons.gc.cuny.edu/files/2014/05/quantum_and_classical_cycles_slides.pdf slides as pdf]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[Jill Cirasella]] ('''2006'''). ''Classical and Quantum Algorithms for Finding Cycles''. M.Sc. thesis, [https://en.wikipedia.org/wiki/University_of_Amsterdam University of Amsterdam], [https://eprints.illc.uva.nl/769/1/MoL-2006-06.text.pdf pdf], [https://jillcirasella.commons.gc.cuny.edu/files/2014/05/quantum_and_classical_cycles_slides.pdf slides as pdf]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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]</div></td></tr>
</table>
GerdIsenberg
https://www.chessprogramming.org/index.php?title=Algorithms&diff=22832&oldid=prev
GerdIsenberg at 15:41, 7 December 2020
2020-12-07T15:41:57Z
<p></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<col class="diff-marker" />
<col class="diff-content" />
<col class="diff-marker" />
<col class="diff-content" />
<tr style="vertical-align: top;" lang="en">
<td colspan="2" style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan="2" style="background-color: white; color:black; text-align: center;">Revision as of 15:41, 7 December 2020</td>
</tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l104" >Line 104:</td>
<td colspan="2" class="diff-lineno">Line 104:</td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[Jill Cirasella]] ('''2006'''). ''Classical and Quantum Algorithms for Finding Cycles''. M.Sc. thesis, [https://en.wikipedia.org/wiki/University_of_Amsterdam University of Amsterdam], [https://eprints.illc.uva.nl/769/1/MoL-2006-06.text.pdf pdf], [https://jillcirasella.commons.gc.cuny.edu/files/2014/05/quantum_and_classical_cycles_slides.pdf slides as pdf]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[Jill Cirasella]] ('''2006'''). ''Classical and Quantum Algorithms for Finding Cycles''. M.Sc. thesis, [https://en.wikipedia.org/wiki/University_of_Amsterdam University of Amsterdam], [https://eprints.illc.uva.nl/769/1/MoL-2006-06.text.pdf pdf], [https://jillcirasella.commons.gc.cuny.edu/files/2014/05/quantum_and_classical_cycles_slides.pdf slides as pdf]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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]</div></td></tr>
<tr><td colspan="2"> </td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">* [[Jon Kleinberg]], [[Mathematician#ETardos|Éva Tardos]] ('''2006'''). ''[https://www.pearson.com/us/higher-education/program/Kleinberg-Algorithm-Design/PGM319216.html Algorithm Design]''. [https://en.wikipedia.org/wiki/Pearson_plc Pearson], [https://en.wikipedia.org/wiki/Addison-Wesley Addison-Wesley]</ins></div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [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</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [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</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[David J. Stracuzzi]] ('''2007'''). ''Randomized Feature Selection''. in [http://scholar.google.com/citations?user=Dzf46C8AAAAJ Huan Liu], [http://www.ar.sanken.osaka-u.ac.jp/~motoda/motopreg.html Hiroshi Motoda] (eds.) [http://www.crcpress.com/product/isbn/9781584888789 Computational Methods of Feature Selection]. [https://en.wikipedia.org/wiki/CRC_Press CRC Press], [http://www.stracuzzi.info/david/manuscripts/cmfs07-randomized.pdf pdf]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[David J. Stracuzzi]] ('''2007'''). ''Randomized Feature Selection''. in [http://scholar.google.com/citations?user=Dzf46C8AAAAJ Huan Liu], [http://www.ar.sanken.osaka-u.ac.jp/~motoda/motopreg.html Hiroshi Motoda] (eds.) [http://www.crcpress.com/product/isbn/9781584888789 Computational Methods of Feature Selection]. [https://en.wikipedia.org/wiki/CRC_Press CRC Press], [http://www.stracuzzi.info/david/manuscripts/cmfs07-randomized.pdf pdf]</div></td></tr>
</table>
GerdIsenberg
https://www.chessprogramming.org/index.php?title=Algorithms&diff=20449&oldid=prev
GerdIsenberg at 21:17, 1 August 2020
2020-08-01T21:17:43Z
<p></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<col class="diff-marker" />
<col class="diff-content" />
<col class="diff-marker" />
<col class="diff-content" />
<tr style="vertical-align: top;" lang="en">
<td colspan="2" style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan="2" style="background-color: white; color:black; text-align: center;">Revision as of 21:17, 1 August 2020</td>
</tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l224" >Line 224:</td>
<td colspan="2" class="diff-lineno">Line 224:</td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>'''[[Programming|Up one Level]]'''</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>'''[[Programming|Up one Level]]'''</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>[[Category:Kraan]]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>[[Category:Kraan]]</div></td></tr>
<tr><td colspan="2"> </td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">[[Category:Hellmut Hattler]]</ins></div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>[[Category:Stamp]]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>[[Category:Stamp]]</div></td></tr>
</table>
GerdIsenberg
https://www.chessprogramming.org/index.php?title=Algorithms&diff=17228&oldid=prev
GerdIsenberg at 12:24, 23 January 2020
2020-01-23T12:24:53Z
<p></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<col class="diff-marker" />
<col class="diff-content" />
<col class="diff-marker" />
<col class="diff-content" />
<tr style="vertical-align: top;" lang="en">
<td colspan="2" style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan="2" style="background-color: white; color:black; text-align: center;">Revision as of 12:24, 23 January 2020</td>
</tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l102" >Line 102:</td>
<td colspan="2" class="diff-lineno">Line 102:</td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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]</div></td></tr>
<tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>* [[Jill Cirasella]] ('''2006'''). ''Classical and Quantum Algorithms for Finding Cycles''. [https://jillcirasella.commons.gc.cuny.edu/files/2014/05/quantum_and_classical_cycles_slides.pdf slides as pdf]</div></td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>* [[Jill Cirasella]] ('''2006'''). ''Classical and Quantum Algorithms for Finding Cycles''. <ins class="diffchange diffchange-inline">M.Sc. thesis, [https://en.wikipedia.org/wiki/University_of_Amsterdam University of Amsterdam], [https://eprints.illc.uva.nl/769/1/MoL-2006-06.text.pdf pdf], </ins>[https://jillcirasella.commons.gc.cuny.edu/files/2014/05/quantum_and_classical_cycles_slides.pdf slides as pdf]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [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</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [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</div></td></tr>
</table>
GerdIsenberg
https://www.chessprogramming.org/index.php?title=Algorithms&diff=17222&oldid=prev
GerdIsenberg at 10:58, 23 January 2020
2020-01-23T10:58:45Z
<p></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<col class="diff-marker" />
<col class="diff-content" />
<col class="diff-marker" />
<col class="diff-content" />
<tr style="vertical-align: top;" lang="en">
<td colspan="2" style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan="2" style="background-color: white; color:black; text-align: center;">Revision as of 10:58, 23 January 2020</td>
</tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l92" >Line 92:</td>
<td colspan="2" class="diff-lineno">Line 92:</td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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]]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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]]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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]</div></td></tr>
<tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>* [[Georgy Adelson-Velsky]], [[Vladimir Arlazarov]], [[Mikhail Donskoy]] ('''1988'''). ''<del class="diffchange diffchange-inline">Algorithms for Games''. Springer, </del>[<del class="diffchange diffchange-inline">http</del>://<del class="diffchange diffchange-inline">www</del>.<del class="diffchange diffchange-inline">amazon</del>.com/<del class="diffchange diffchange-inline">Algorithms</del>-<del class="diffchange diffchange-inline">Games</del>-<del class="diffchange diffchange-inline">Georgy</del>-<del class="diffchange diffchange-inline">M</del>-<del class="diffchange diffchange-inline">Adelson-Velsky</del>/<del class="diffchange diffchange-inline">dp</del>/<del class="diffchange diffchange-inline">0387966293 amazon</del>.<del class="diffchange diffchange-inline">com</del>]</div></td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>* [[Georgy Adelson-Velsky]], [[Vladimir Arlazarov]], [[Mikhail Donskoy]] ('''1988'''). ''[<ins class="diffchange diffchange-inline">https</ins>://<ins class="diffchange diffchange-inline">link</ins>.<ins class="diffchange diffchange-inline">springer</ins>.com/<ins class="diffchange diffchange-inline">book/10.1007%2F978</ins>-<ins class="diffchange diffchange-inline">1</ins>-<ins class="diffchange diffchange-inline">4612</ins>-<ins class="diffchange diffchange-inline">3796</ins>-<ins class="diffchange diffchange-inline">9 Algorithms for Games]''. [https:</ins>//<ins class="diffchange diffchange-inline">en</ins>.<ins class="diffchange diffchange-inline">wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer</ins>]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==1990 ...==</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==1990 ...==</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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]]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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]]</div></td></tr>
</table>
GerdIsenberg
https://www.chessprogramming.org/index.php?title=Algorithms&diff=11918&oldid=prev
GerdIsenberg at 08:56, 1 May 2019
2019-05-01T08:56:49Z
<p></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<col class="diff-marker" />
<col class="diff-content" />
<col class="diff-marker" />
<col class="diff-content" />
<tr style="vertical-align: top;" lang="en">
<td colspan="2" style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan="2" style="background-color: white; color:black; text-align: center;">Revision as of 08:56, 1 May 2019</td>
</tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l124" >Line 124:</td>
<td colspan="2" class="diff-lineno">Line 124:</td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [https://en.wikipedia.org/wiki/Algorithm_characterizations Algorithm characterizations from Wikipedia]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [https://en.wikipedia.org/wiki/Algorithm_characterizations Algorithm characterizations from Wikipedia]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [https://en.wikipedia.org/wiki/Analysis_of_algorithms Analysis of algorithms from Wikipedia]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [https://en.wikipedia.org/wiki/Analysis_of_algorithms Analysis of algorithms from Wikipedia]</div></td></tr>
<tr><td colspan="2"> </td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">* [https://en.wikipedia.org/wiki/Algorithmic_efficiency Algorithmic efficiency from Wikipedia]</ins></div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [https://en.wikipedia.org/wiki/Big_O_notation Big O notation from Wikipedia]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [https://en.wikipedia.org/wiki/Big_O_notation Big O notation from Wikipedia]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [https://en.wikibooks.org/wiki/Algorithms Algorithms - Wikibooks]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [https://en.wikibooks.org/wiki/Algorithms Algorithms - Wikibooks]</div></td></tr>
<tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l143" >Line 143:</td>
<td colspan="2" class="diff-lineno">Line 144:</td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>: [https://en.wikipedia.org/wiki/Nondeterministic_algorithm Nondeterministic algorithm]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>: [https://en.wikipedia.org/wiki/Nondeterministic_algorithm Nondeterministic algorithm]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>: [https://en.wikipedia.org/wiki/Metaheuristic Metaheuristic]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>: [https://en.wikipedia.org/wiki/Metaheuristic Metaheuristic]</div></td></tr>
<tr><td colspan="2"> </td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">: [https://en.wikipedia.org/wiki/Online_algorithm Online algorithm]</ins></div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>: [https://en.wikipedia.org/wiki/Parallel_algorithm Parallel algorithm]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>: [https://en.wikipedia.org/wiki/Parallel_algorithm Parallel algorithm]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>: [https://en.wikipedia.org/wiki/Quantum_algorithm Quantum algorithm]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>: [https://en.wikipedia.org/wiki/Quantum_algorithm Quantum algorithm]</div></td></tr>
<tr><td colspan="2"> </td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">: [https://en.wikipedia.org/wiki/Streaming_algorithm Streaming algorithm]</ins></div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [https://en.wikipedia.org/wiki/Randomized_algorithm Randomized algorithm from Wikipedia]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [https://en.wikipedia.org/wiki/Randomized_algorithm Randomized algorithm from Wikipedia]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>: [https://en.wikipedia.org/wiki/Las_Vegas_algorithm Las Vegas algorithm]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>: [https://en.wikipedia.org/wiki/Las_Vegas_algorithm Las Vegas algorithm]</div></td></tr>
<tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l195" >Line 195:</td>
<td colspan="2" class="diff-lineno">Line 198:</td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [https://en.wikipedia.org/wiki/Sorting_algorithm Sorting algorithm from Wikipedia]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [https://en.wikipedia.org/wiki/Sorting_algorithm Sorting algorithm from Wikipedia]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==Complexity==  </div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==Complexity==  </div></td></tr>
<tr><td colspan="2"> </td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">* [https://en.wikipedia.org/wiki/Complexity Complexity from Wikipedia]</ins></div></td></tr>
<tr><td colspan="2"> </td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">* [https://en.wikipedia.org/wiki/Combinatorial_explosion Combinatorial explosion from Wikipedia]</ins></div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [https://en.wikipedia.org/wiki/Category:Computational_complexity_theory Category: Computational complexity theory from Wikipedia]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [https://en.wikipedia.org/wiki/Category:Computational_complexity_theory Category: Computational complexity theory from Wikipedia]</div></td></tr>
<tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;">* [https://en.wikipedia.org/wiki/Combinatorial_explosion Combinatorial explosion from Wikipedia]</del></div></td><td colspan="2"> </td></tr>
<tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;">* [https://en.wikipedia.org/wiki/Complexity Complexity from Wikipedia]</del></div></td><td colspan="2"> </td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [https://en.wikipedia.org/wiki/Complexity_class Complexity class from Wikipedia]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [https://en.wikipedia.org/wiki/Complexity_class Complexity class from Wikipedia]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [http://www.ics.uci.edu/~eppstein/cgt/hard.html Computational Complexity of Games and Puzzles] by [[David Eppstein]]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [http://www.ics.uci.edu/~eppstein/cgt/hard.html Computational Complexity of Games and Puzzles] by [[David Eppstein]]</div></td></tr>
</table>
GerdIsenberg
https://www.chessprogramming.org/index.php?title=Algorithms&diff=9025&oldid=prev
GerdIsenberg at 14:34, 6 December 2018
2018-12-06T14:34:17Z
<p></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<col class="diff-marker" />
<col class="diff-content" />
<col class="diff-marker" />
<col class="diff-content" />
<tr style="vertical-align: top;" lang="en">
<td colspan="2" style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan="2" style="background-color: white; color:black; text-align: center;">Revision as of 14:34, 6 December 2018</td>
</tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l221" >Line 221:</td>
<td colspan="2" class="diff-lineno">Line 221:</td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>'''[[Programming|Up one Level]]'''</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>'''[[Programming|Up one Level]]'''</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>[[Category:Kraan]]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>[[Category:Kraan]]</div></td></tr>
<tr><td colspan="2"> </td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">[[Category:Stamp]]</ins></div></td></tr>
</table>
GerdIsenberg
https://www.chessprogramming.org/index.php?title=Algorithms&diff=8614&oldid=prev
GerdIsenberg at 20:57, 20 November 2018
2018-11-20T20:57:57Z
<p></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<col class="diff-marker" />
<col class="diff-content" />
<col class="diff-marker" />
<col class="diff-content" />
<tr style="vertical-align: top;" lang="en">
<td colspan="2" style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan="2" style="background-color: white; color:black; text-align: center;">Revision as of 20:57, 20 November 2018</td>
</tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l114" >Line 114:</td>
<td colspan="2" class="diff-lineno">Line 114:</td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[Matteo Frigo]], [[Charles Leiserson]], [[Harald Prokop]], [https://dblp.uni-trier.de/pers/hd/r/Ramachandran:Sridhar Sridhar Ramachandran] ('''2012'''). ''Cache-Oblivious Algorithms''. [[ACM#TALG|ACM Transactions on Algorithms]], Vol. 8, No. 1, [http://supertech.csail.mit.edu/papers/FrigoLePr12.pdf pdf]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[Matteo Frigo]], [[Charles Leiserson]], [[Harald Prokop]], [https://dblp.uni-trier.de/pers/hd/r/Ramachandran:Sridhar Sridhar Ramachandran] ('''2012'''). ''Cache-Oblivious Algorithms''. [[ACM#TALG|ACM Transactions on Algorithms]], Vol. 8, No. 1, [http://supertech.csail.mit.edu/papers/FrigoLePr12.pdf pdf]</div></td></tr>
<tr><td colspan="2"> </td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">* <span id="ACM-Turing"></span>[[Mathematician#CHPapadimitriou|Christos H. Papadimitriou]], [[Mathematician#LAdleman|Leonard Adleman]], [[Richard Karp]], [[Donald Knuth]], [[Mathematician#RETarjan|Robert E. Tarjan]], [[Mathematician#LValiant|Leslie Valiant]] ('''2012'''). ''[https://dl.acm.org/citation.cfm?id=2322189 An Algorithmic View of the Universe]''. ACM-Turing 2012 » [[Alan Turing]]</ins></div></td></tr>
<tr><td colspan="2"> </td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">: {{#evu:https://www.youtube.com/watch?v=f6df3s3x3zo|alignment=left|valignment=top}}</ins></div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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]]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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]]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr>
</table>
GerdIsenberg
https://www.chessprogramming.org/index.php?title=Algorithms&diff=8496&oldid=prev
GerdIsenberg at 15:52, 13 November 2018
2018-11-13T15:52:05Z
<p></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<col class="diff-marker" />
<col class="diff-content" />
<col class="diff-marker" />
<col class="diff-content" />
<tr style="vertical-align: top;" lang="en">
<td colspan="2" style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan="2" style="background-color: white; color:black; text-align: center;">Revision as of 15:52, 13 November 2018</td>
</tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l113" >Line 113:</td>
<td colspan="2" class="diff-lineno">Line 113:</td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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]</div></td></tr>
<tr><td colspan="2"> </td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">* [[Matteo Frigo]], [[Charles Leiserson]], [[Harald Prokop]], [https://dblp.uni-trier.de/pers/hd/r/Ramachandran:Sridhar Sridhar Ramachandran] ('''2012'''). ''Cache-Oblivious Algorithms''. [[ACM#TALG|ACM Transactions on Algorithms]], Vol. 8, No. 1, [http://supertech.csail.mit.edu/papers/FrigoLePr12.pdf pdf]</ins></div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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]]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[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]]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr>
</table>
GerdIsenberg
https://www.chessprogramming.org/index.php?title=Algorithms&diff=5040&oldid=prev
GerdIsenberg at 16:06, 29 June 2018
2018-06-29T16:06:26Z
<p></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<col class="diff-marker" />
<col class="diff-content" />
<col class="diff-marker" />
<col class="diff-content" />
<tr style="vertical-align: top;" lang="en">
<td colspan="2" style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan="2" style="background-color: white; color:black; text-align: center;">Revision as of 16:06, 29 June 2018</td>
</tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l210" >Line 210:</td>
<td colspan="2" class="diff-lineno">Line 210:</td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [https://en.wikipedia.org/wiki/Correctness_%28computer_science%29 Correctness (computer science) from Wikipedia]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [https://en.wikipedia.org/wiki/Correctness_%28computer_science%29 Correctness (computer science) from Wikipedia]</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [https://en.wikipedia.org/wiki/Halting_problem Halting problem from Wikipedia]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [https://en.wikipedia.org/wiki/Halting_problem Halting problem from Wikipedia]</div></td></tr>
<tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>* [[<del class="diffchange diffchange-inline">Videos#</del>Kraan|Kraan]] - [https://www.flashlyrics.com/lyrics/kraan/gut-und-richtig-03 Gut und Richtig] (1973), [https://en.wikipedia.org/wiki/YouTube YouTube] Video</div></td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>* [[<ins class="diffchange diffchange-inline">:Category:</ins>Kraan|Kraan]] - [https://www.flashlyrics.com/lyrics/kraan/gut-und-richtig-03 Gut und Richtig] (1973), [https://en.wikipedia.org/wiki/YouTube YouTube] Video</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>: {{#evu:https://www.youtube.com/watch?v=HjR320Y4NTQ|alignment=left|valignment=top}}</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>: {{#evu:https://www.youtube.com/watch?v=HjR320Y4NTQ|alignment=left|valignment=top}}</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr>
<tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l217" >Line 217:</td>
<td colspan="2" class="diff-lineno">Line 217:</td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>'''[[Programming|Up one Level]]'''</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>'''[[Programming|Up one Level]]'''</div></td></tr>
<tr><td colspan="2"> </td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">[[Category:Kraan]]</ins></div></td></tr>
</table>
GerdIsenberg