Sierpiński triangle (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Sierpiński triangle" in English language version.

refsWebsite

Global rank English rank

6doi.org

2^nd place

5semanticscholar.org

11^th place

8^th place

4web.archive.org

1^st place

3arxiv.org

69^th place

59^th place

3books.google.com

3^rd place

2cut-the-knot.org

low place

2archive.org

6^th place

1itu.dk

low place

1bnf.fr

124^th place

544^th place

1researchgate.net

120^th place

125^th place

1uni-jena.de

4,878^th place

4,120^th place

1nih.gov

4^th place

1ams.org

451^st place

277^th place

1zbmath.org

1,923^rd place

1,068^th place

1maa.org

3,479^th place

2,444^th place

ams.org

mathscinet.ams.org

Romik, Dan (2006), "Shortest paths in the Tower of Hanoi graph and finite automata", SIAM Journal on Discrete Mathematics, 20 (3): 610–62, arXiv:math.CO/0310109, doi:10.1137/050628660, MR 2272218, S2CID 8342396.

archive.org

Falconer, Kenneth (1990). Fractal geometry: mathematical foundations and applications. Chichester: John Wiley. p. 120. ISBN 978-0-471-92287-2. Zbl 0689.28003.
Mandelbrot B (1983). The Fractal Geometry of Nature. New York: W. H. Freeman. p. 170. ISBN 978-0-7167-1186-5.

arxiv.org

Michael Barnsley; et al. (2003), "V-variable fractals and superfractals", arXiv:math/0312314
Khovanova, Tanya; Nie, Eric; Puranik, Alok (2014), "The Sierpinski Triangle and the Ulam-Warburton Automaton", Math Horizons, 23 (1): 5–9, arXiv:1408.5937, doi:10.4169/mathhorizons.23.1.5, S2CID 125503155
Romik, Dan (2006), "Shortest paths in the Tower of Hanoi graph and finite automata", SIAM Journal on Discrete Mathematics, 20 (3): 610–62, arXiv:math.CO/0310109, doi:10.1137/050628660, MR 2272218, S2CID 8342396.

bnf.fr

gallica.bnf.fr

Sierpiński, Waclaw (1915). "Sur une courbe dont tout point est un point de ramification". Compt. Rend. Acad. Sci. Paris. 160: 302–305. Archived from the original on 2020-08-06. Retrieved 2020-04-21.

books.google.com

Feldman, David P. (2012), "17.4 The chaos game", Chaos and Fractals: An Elementary Introduction, Oxford University Press, pp. 178–180, ISBN 9780199566440.
Stewart, Ian (2006), How to Cut a Cake: And other mathematical conundrums, Oxford University Press, p. 145, ISBN 9780191500718.
Helmberg, Gilbert (2007), Getting Acquainted with Fractals, Walter de Gruyter, p. 41, ISBN 9783110190922.

cut-the-knot.org

doi.org

Brunori, Paola; Magrone, Paola; Lalli, Laura Tedeschini (2018-07-07), Imperial Porphiry and Golden Leaf: Sierpinski Triangle in a Medieval Roman Cloister, Advances in Intelligent Systems and Computing, vol. 809, Springer International Publishing, pp. 595–609, doi:10.1007/978-3-319-95588-9_49, ISBN 9783319955872, S2CID 125313277
Bilotta, Eleonora; Pantano, Pietro (Summer 2005), "Emergent patterning phenomena in 2D cellular automata", Artificial Life, 11 (3): 339–362, doi:10.1162/1064546054407167, PMID 16053574, S2CID 7842605.
Khovanova, Tanya; Nie, Eric; Puranik, Alok (2014), "The Sierpinski Triangle and the Ulam-Warburton Automaton", Math Horizons, 23 (1): 5–9, arXiv:1408.5937, doi:10.4169/mathhorizons.23.1.5, S2CID 125503155
Romik, Dan (2006), "Shortest paths in the Tower of Hanoi graph and finite automata", SIAM Journal on Discrete Mathematics, 20 (3): 610–62, arXiv:math.CO/0310109, doi:10.1137/050628660, MR 2272218, S2CID 8342396.
Jones, Huw; Campa, Aurelio (1993), "Abstract and natural forms from iterated function systems", in Thalmann, N. M.; Thalmann, D. (eds.), Communicating with Virtual Worlds, CGS CG International Series, Tokyo: Springer, pp. 332–344, doi:10.1007/978-4-431-68456-5_27, ISBN 978-4-431-68458-9
Williams, Kim (December 1997). Stewart, Ian (ed.). "The pavements of the Cosmati". The Mathematical Tourist. The Mathematical Intelligencer. 19 (1): 41–45. doi:10.1007/bf03024339. S2CID 189885713.

itu.dk

blog.itu.dk

Prusinkiewicz, P. (1986), "Graphical applications of L-systems" (PDF), Proceedings of Graphics Interface '86 / Vision Interface '86, pp. 247–253, archived from the original (PDF) on 2014-03-20, retrieved 2014-03-19.

maa.org

Shannon, Kathleen M.; Bardzell, Michael J. (November 2003). "Patterns in Pascal's Triangle – with a Twist". Convergence. Mathematical Association of America. Archived from the original on 7 September 2015. Retrieved 29 March 2015.

nih.gov

pubmed.ncbi.nlm.nih.gov

Bilotta, Eleonora; Pantano, Pietro (Summer 2005), "Emergent patterning phenomena in 2D cellular automata", Artificial Life, 11 (3): 339–362, doi:10.1162/1064546054407167, PMID 16053574, S2CID 7842605.

researchgate.net

Brunori, Paola; Magrone, Paola; Lalli, Laura Tedeschini (2018-07-07), Imperial Porphiry and Golden Leaf: Sierpinski Triangle in a Medieval Roman Cloister, Advances in Intelligent Systems and Computing, vol. 809, Springer International Publishing, pp. 595–609, doi:10.1007/978-3-319-95588-9_49, ISBN 9783319955872, S2CID 125313277

semanticscholar.org

api.semanticscholar.org

Brunori, Paola; Magrone, Paola; Lalli, Laura Tedeschini (2018-07-07), Imperial Porphiry and Golden Leaf: Sierpinski Triangle in a Medieval Roman Cloister, Advances in Intelligent Systems and Computing, vol. 809, Springer International Publishing, pp. 595–609, doi:10.1007/978-3-319-95588-9_49, ISBN 9783319955872, S2CID 125313277
Bilotta, Eleonora; Pantano, Pietro (Summer 2005), "Emergent patterning phenomena in 2D cellular automata", Artificial Life, 11 (3): 339–362, doi:10.1162/1064546054407167, PMID 16053574, S2CID 7842605.
Khovanova, Tanya; Nie, Eric; Puranik, Alok (2014), "The Sierpinski Triangle and the Ulam-Warburton Automaton", Math Horizons, 23 (1): 5–9, arXiv:1408.5937, doi:10.4169/mathhorizons.23.1.5, S2CID 125503155
Romik, Dan (2006), "Shortest paths in the Tower of Hanoi graph and finite automata", SIAM Journal on Discrete Mathematics, 20 (3): 610–62, arXiv:math.CO/0310109, doi:10.1137/050628660, MR 2272218, S2CID 8342396.
Williams, Kim (December 1997). Stewart, Ian (ed.). "The pavements of the Cosmati". The Mathematical Tourist. The Mathematical Intelligencer. 19 (1): 41–45. doi:10.1007/bf03024339. S2CID 189885713.

uni-jena.de

cmc11.uni-jena.de

Rumpf, Thomas (2010), "Conway's Game of Life accelerated with OpenCL" (PDF), Proceedings of the Eleventh International Conference on Membrane Computing (CMC 11), pp. 459–462, archived (PDF) from the original on 2016-07-29, retrieved 2014-03-19.

web.archive.org

Prusinkiewicz, P. (1986), "Graphical applications of L-systems" (PDF), Proceedings of Graphics Interface '86 / Vision Interface '86, pp. 247–253, archived from the original (PDF) on 2014-03-20, retrieved 2014-03-19.
Sierpiński, Waclaw (1915). "Sur une courbe dont tout point est un point de ramification". Compt. Rend. Acad. Sci. Paris. 160: 302–305. Archived from the original on 2020-08-06. Retrieved 2020-04-21.
Rumpf, Thomas (2010), "Conway's Game of Life accelerated with OpenCL" (PDF), Proceedings of the Eleventh International Conference on Membrane Computing (CMC 11), pp. 459–462, archived (PDF) from the original on 2016-07-29, retrieved 2014-03-19.
Shannon, Kathleen M.; Bardzell, Michael J. (November 2003). "Patterns in Pascal's Triangle – with a Twist". Convergence. Mathematical Association of America. Archived from the original on 7 September 2015. Retrieved 29 March 2015.

zbmath.org

Falconer, Kenneth (1990). Fractal geometry: mathematical foundations and applications. Chichester: John Wiley. p. 120. ISBN 978-0-471-92287-2. Zbl 0689.28003.