Dickson's lemma (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Dickson's lemma" in English language version.

refsWebsite

Global rank English rank

2^nd place

69^th place

59^th place

26^th place

20^th place

3^rd place

451^st place

277^th place

11^th place

8^th place

18^th place

17^th place

ams.org

Figueira, Diego; Figueira, Santiago; Schmitz, Sylvain; Schnoebelen, Philippe (2011), "Ackermannian and primitive-recursive bounds with Dickson's lemma", 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011), IEEE Computer Soc., Los Alamitos, CA, p. 269, arXiv:1007.2989, doi:10.1109/LICS.2011.39, MR 2858898, S2CID 9178090.

Figueira, Diego; Figueira, Santiago; Schmitz, Sylvain; Schnoebelen, Philippe (2011), "Ackermannian and primitive-recursive bounds with Dickson's lemma", 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011), IEEE Computer Soc., Los Alamitos, CA, p. 269, arXiv:1007.2989, doi:10.1109/LICS.2011.39, MR 2858898, S2CID 9178090.
Onn, Shmuel (2008), "Convex Discrete Optimization", in Floudas, Christodoulos A.; Pardalos, Panos M. (eds.), Encyclopedia of Optimization, Vol. 1 (2nd ed.), Springer, pp. 513–550, arXiv:math/0703575, Bibcode:2007math......3575O, ISBN 9780387747583.

Buchberger, Bruno; Winkler, Franz (1998), Gröbner Bases and Applications, London Mathematical Society Lecture Note Series, vol. 251, Cambridge University Press, p. 83, ISBN 9780521632980.

Dickson, L. E. (1913), "Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors", American Journal of Mathematics, 35 (4): 413–422, doi:10.2307/2370405, JSTOR 2370405.
Kruskal, Joseph B. (1972). "The theory of well-quasi-ordering: A frequently discovered concept". Journal of Combinatorial Theory. Series A. 13 (3): 298. doi:10.1016/0097-3165(72)90063-5.
Figueira, Diego; Figueira, Santiago; Schmitz, Sylvain; Schnoebelen, Philippe (2011), "Ackermannian and primitive-recursive bounds with Dickson's lemma", 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011), IEEE Computer Soc., Los Alamitos, CA, p. 269, arXiv:1007.2989, doi:10.1109/LICS.2011.39, MR 2858898, S2CID 9178090.

Onn, Shmuel (2008), "Convex Discrete Optimization", in Floudas, Christodoulos A.; Pardalos, Panos M. (eds.), Encyclopedia of Optimization, Vol. 1 (2nd ed.), Springer, pp. 513–550, arXiv:math/0703575, Bibcode:2007math......3575O, ISBN 9780387747583.

Dickson, L. E. (1913), "Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors", American Journal of Mathematics, 35 (4): 413–422, doi:10.2307/2370405, JSTOR 2370405.

Figueira, Diego; Figueira, Santiago; Schmitz, Sylvain; Schnoebelen, Philippe (2011), "Ackermannian and primitive-recursive bounds with Dickson's lemma", 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011), IEEE Computer Soc., Los Alamitos, CA, p. 269, arXiv:1007.2989, doi:10.1109/LICS.2011.39, MR 2858898, S2CID 9178090.