Ханојска кула (Serbian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Ханојска кула" in Serbian language version.

refsWebsite

Global rank Serbian rank

8doi.org

2^nd place

4^th place

4web.archive.org

1^st place

3archive.org

6^th place

5^th place

1informs.org

low place

1taylorandfrancis.com

low place

1biologists.org

3,870^th place

2,631^st place

1nih.gov

4^th place

8^th place

1oxfordjournals.org

1,389^th place

438^th place

1jstor.org

26^th place

57^th place

1ijcai.org

low place

1wm.edu

4,553^rd place

6,032^nd place

1berkeycolortran.wordpress.com

low place

1giantbomb.com

2,694^th place

9,073^rd place

1segaarcade.com

low place

1acs.org

1,248^th place

389^th place

acs.org

pubs.acs.org

Yin, Xi; Liu, Xinhong; Pan, Yung-Tin; Walsh, Kathleen A.; Yang, Hong (4. 11. 2014). „Hanoi Tower-like Multilayered Ultrathin Palladium Nanosheets”. Nano Letters. doi:10.1021/nl503879a.

archive.org

Hofstadter 1985 Hofstadter, Douglas R. (1985). Metamagical Themas : Questing for the Essence of Mind and Pattern. New York: Basic Books. ISBN 978-0-465-04540-2.
Spitznagel 1971, стр. 137. Spitznagel, Edward L. (1971). Selected topics in mathematics. Holt, Rinehart and Winston. стр. 137. ISBN 978-0-03-084693-9.
Petković 2009, стр. 197. Petković, Miodrag (2009). Famous Puzzles of Great Mathematicians. AMS Bookstore. стр. 197. ISBN 978-0-8218-4814-2.

berkeycolortran.wordpress.com

„University of Toronto CSC148 Slog”. 5. 4. 2014. Приступљено 22. 7. 2015.

biologists.org

jeb.biologists.org

Reid, C.R.; Sumpter, D.J.; Beekman, M. (2011). „Optimisation in a natural system: Argentine ants solve the Towers of Hanoi”. J. Exp. Biol. 214 (Pt 1): 50—8. PMID 21147968. doi:10.1242/jeb.048173.

doi.org

Mayer, Herbert; Perkins, Don (1984). „Towers of Hanoi Revisited”. SIGPLAN Notices: 80—84. doi:10.1145/948566.948573.
Reid, C.R.; Sumpter, D.J.; Beekman, M. (2011). „Optimisation in a natural system: Argentine ants solve the Towers of Hanoi”. J. Exp. Biol. 214 (Pt 1): 50—8. PMID 21147968. doi:10.1242/jeb.048173.
Hinz, A. (1989). „The Tower of Hanoi”. L'Enseignement Mathematique. 35: 289—321. doi:10.5169/seals-57378.
Chan, T. (1988). „A statistical analysis of the towers of Hanoi problem”. Internat. J. Comput. Math. 28: 57—65. doi:10.1080/00207168908803728.
Romik, D. (2006). „Shortest paths in the Tower of Hanoi graph and finite automata”. SIAM Journal on Discrete Mathematics. 20 (3): 610—622. doi:10.1137/050628660.
Gedeon, T. D. (1996). „The Cyclic Towers of Hanoi: An Iterative Solution Produced by Transformation”. The Computer Journal. 39 (4). doi:10.1093/comjnl/39.4.353.
Stewart, B.M.; Frame, J.S. (1941). „Solution to advanced problem 3819”. American Mathematical Monthly. 48 (3): 216—9. JSTOR 2304268. doi:10.2307/2304268.
Yin, Xi; Liu, Xinhong; Pan, Yung-Tin; Walsh, Kathleen A.; Yang, Hong (4. 11. 2014). „Hanoi Tower-like Multilayered Ultrathin Palladium Nanosheets”. Nano Letters. doi:10.1021/nl503879a.

giantbomb.com

„Tower of Hanoi (video game concept)”. giantbomb.com. Приступљено 5. 12. 2010.

ijcai.org

Korf, Richard E.; Felner, Ariel (2007). „Recent Progress in Heuristic Search: a Case Study of the Four-Peg Towers of Hanoi Problem” (PDF). IJCAI: 2324—9. Архивирано из оригинала (PDF) 24. 09. 2015. г. Приступљено 31. 10. 2015.

informs.org

archive.ite.journal.informs.org

Sniedovich, Moshe (2002). „OR/MS Games: 2. The Towers of Hanoi Problem,”. INFORMS Transactions on Education. 3 (1): 34—51.

jstor.org

Stewart, B.M.; Frame, J.S. (1941). „Solution to advanced problem 3819”. American Mathematical Monthly. 48 (3): 216—9. JSTOR 2304268. doi:10.2307/2304268.

nih.gov

ncbi.nlm.nih.gov

Reid, C.R.; Sumpter, D.J.; Beekman, M. (2011). „Optimisation in a natural system: Argentine ants solve the Towers of Hanoi”. J. Exp. Biol. 214 (Pt 1): 50—8. PMID 21147968. doi:10.1242/jeb.048173.

oxfordjournals.org

comjnl.oxfordjournals.org

Gedeon, T. D. (1996). „The Cyclic Towers of Hanoi: An Iterative Solution Produced by Transformation”. The Computer Journal. 39 (4). doi:10.1093/comjnl/39.4.353.

segaarcade.com

„Архивирана копија”. Архивирано из оригинала 01. 03. 2012. г. Приступљено 31. 10. 2015.

taylorandfrancis.com

Sniedovich, Moshe (2010). Dynamic Programming: Foundations and Principles. Taylor & Francis. ISBN 978-0-8247-4099-3. Архивирано из оригинала 24. 09. 2015. г. Приступљено 29. 10. 2015.

web.archive.org

Sniedovich, Moshe (2010). Dynamic Programming: Foundations and Principles. Taylor & Francis. ISBN 978-0-8247-4099-3. Архивирано из оригинала 24. 09. 2015. г. Приступљено 29. 10. 2015.
Miller, Charles D. (2000). „Ch. 4: Binary Numbers and the Standard Gray Code”. Mathematical Ideas (9 изд.). Addison Wesley Longman. ISBN 978-0-321-07607-6. Архивирано из оригинала 21. 08. 2004. г. Приступљено 30. 10. 2015.
Korf, Richard E.; Felner, Ariel (2007). „Recent Progress in Heuristic Search: a Case Study of the Four-Peg Towers of Hanoi Problem” (PDF). IJCAI: 2324—9. Архивирано из оригинала (PDF) 24. 09. 2015. г. Приступљено 31. 10. 2015.
„Архивирана копија”. Архивирано из оригинала 01. 03. 2012. г. Приступљено 31. 10. 2015.

wm.edu

cs.wm.edu

Stockmeyer, Paul (1994). „Variations on the Four-Post Tower of Hanoi Puzzle” (Postscript). Congressus Numerantium. 102: 3—12.