Iterated logarithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Iterated logarithm" in English language version.

refsWebsite

Global rank English rank

5doi.org

2^nd place

4ams.org

451^st place

277^th place

2archive.org

6^th place

1handle.net

102^nd place

76^th place

1hal.science

low place

1arxiv.org

69^th place

59^th place

1semanticscholar.org

11^th place

8^th place

1princeton.edu

741^st place

577^th place

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Furuya, Isamu; Kida, Takuya (2019). "Compaction of Church numerals". Algorithms. 12 (8) 159: 159. doi:10.3390/a12080159. hdl:2115/75613. MR 3998658.
Devillers, Olivier (March 1992). "Randomization yields simple $O(n\log ^{\ast }n)$ algorithms for difficult $\Omega (n)$ problems" (PDF). International Journal of Computational Geometry & Applications. 2 (1): 97–111. arXiv:cs/9810007. doi:10.1142/S021819599200007X. MR 1159844. S2CID 60203.
Alon, Noga; Azar, Yossi (April 1989). "Finding an approximate maximum" (PDF). SIAM Journal on Computing. 18 (2): 258–267. doi:10.1137/0218017. MR 0986665.
Cole, Richard; Vishkin, Uzi (July 1986). "Deterministic coin tossing with applications to optimal parallel list ranking" (PDF). Information and Control. 70 (1): 32–53. doi:10.1016/S0019-9958(86)80023-7. MR 0853994.

archive.org (Global: 6^th place; English: 6^th place)

archive.org

Cole, Richard; Vishkin, Uzi (July 1986). "Deterministic coin tossing with applications to optimal parallel list ranking" (PDF). Information and Control. 70 (1): 32–53. doi:10.1016/S0019-9958(86)80023-7. MR 0853994.

scholar.archive.org

Santhanam, Rahul (2001). "On separators, segregators and time versus space" (PDF). Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001. IEEE Computer Society. pp. 286–294. doi:10.1109/CCC.2001.933895. ISBN 0-7695-1053-1.

arxiv.org (Global: 69^th place; English: 59^th place)

Devillers, Olivier (March 1992). "Randomization yields simple $O(n\log ^{\ast }n)$ algorithms for difficult $\Omega (n)$ problems" (PDF). International Journal of Computational Geometry & Applications. 2 (1): 97–111. arXiv:cs/9810007. doi:10.1142/S021819599200007X. MR 1159844. S2CID 60203.

doi.org (Global: 2^nd place; English: 2^nd place)

Furuya, Isamu; Kida, Takuya (2019). "Compaction of Church numerals". Algorithms. 12 (8) 159: 159. doi:10.3390/a12080159. hdl:2115/75613. MR 3998658.
Devillers, Olivier (March 1992). "Randomization yields simple $O(n\log ^{\ast }n)$ algorithms for difficult $\Omega (n)$ problems" (PDF). International Journal of Computational Geometry & Applications. 2 (1): 97–111. arXiv:cs/9810007. doi:10.1142/S021819599200007X. MR 1159844. S2CID 60203.
Alon, Noga; Azar, Yossi (April 1989). "Finding an approximate maximum" (PDF). SIAM Journal on Computing. 18 (2): 258–267. doi:10.1137/0218017. MR 0986665.
Cole, Richard; Vishkin, Uzi (July 1986). "Deterministic coin tossing with applications to optimal parallel list ranking" (PDF). Information and Control. 70 (1): 32–53. doi:10.1016/S0019-9958(86)80023-7. MR 0853994.
Santhanam, Rahul (2001). "On separators, segregators and time versus space" (PDF). Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001. IEEE Computer Society. pp. 286–294. doi:10.1109/CCC.2001.933895. ISBN 0-7695-1053-1.

hal.science (Global: low place; English: low place)

inria.hal.science

Devillers, Olivier (March 1992). "Randomization yields simple $O(n\log ^{\ast }n)$ algorithms for difficult $\Omega (n)$ problems" (PDF). International Journal of Computational Geometry & Applications. 2 (1): 97–111. arXiv:cs/9810007. doi:10.1142/S021819599200007X. MR 1159844. S2CID 60203.

handle.net (Global: 102^nd place; English: 76^th place)

hdl.handle.net

Furuya, Isamu; Kida, Takuya (2019). "Compaction of Church numerals". Algorithms. 12 (8) 159: 159. doi:10.3390/a12080159. hdl:2115/75613. MR 3998658.

princeton.edu (Global: 741^st place; English: 577^th place)

web.math.princeton.edu

Alon, Noga; Azar, Yossi (April 1989). "Finding an approximate maximum" (PDF). SIAM Journal on Computing. 18 (2): 258–267. doi:10.1137/0218017. MR 0986665.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Devillers, Olivier (March 1992). "Randomization yields simple $O(n\log ^{\ast }n)$ algorithms for difficult $\Omega (n)$ problems" (PDF). International Journal of Computational Geometry & Applications. 2 (1): 97–111. arXiv:cs/9810007. doi:10.1142/S021819599200007X. MR 1159844. S2CID 60203.

Iterated logarithm (English Wikipedia)

ams.org (Global: 451st place; English: 277th place)